Detachments of complete graphs

Edwards, K. (2005). Detachments of complete graphs.

Type

Unclassified

Intellectual base

Unclassified

Year

2005

DOI

10.1017/s0963548304006558

Link

https://doi.org/10.1017/s0963548304006558

Cited by

1 citation across 1 artifact.

Domain-specific

• Exact coloring
  • Exact refers to pairwise color-edge multiplicity rather than use of exactly k colors alone, color classes must be independent and every color pair must occur both at least and at most once.

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