Covering graphs by the minimum number of equivalence relations

Alon, N. (1986). Covering graphs by the minimum number of equivalence relations.

Type

Unclassified

Intellectual base

Unclassified

Year

1986

DOI

10.1007/bf02579381

Link

https://doi.org/10.1007/bf02579381

Cited by

1 citation across 1 artifact.

Domain-specific

• Intersection number (graph theory)
  • Each vertex receives a subset of a finite universe and two vertices are adjacent exactly when their subsets intersect; minimizing universe elements equals minimizing cliques whose union covers every edge.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:9c6eaf38436a · see in the full table