Packings of graphs and applications to computational complexity

B Bollobás, S. E. E. (1978). Packings of graphs and applications to computational complexity.

Type

Unclassified

Intellectual base

Unclassified

Year

1978

DOI

10.1016/0097-3165(78)90073-0

Link

https://doi.org/10.1016/0097-3165(78)90073-0

Cited by

1 citation across 1 artifact.

Domain-specific

• Equitable coloring
  • … transfers from A canonical instance directly demonstrates that every edge has differently colored endpoints and the sizes of any two of the declared k color classes differ by at most one. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..

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:092aa3510d35 · see in the full table