Graph Classes

Andreas Brandstädt, V. B. L., & Spinrad, J. (1999). Graph Classes: A Survey.

Type

Unclassified

Intellectual base

Unclassified

Year

1999

Link

no authoritative link yet

Cited by

2 citations across 2 artifacts.

Domain-specific

• Cograph
  • … and a convenient observable transfers from Every complete graph and every disjoint union of complete graphs is a cograph, while P4 itself is the minimal forbidden graph. to An algorithm builds a cotree in linear time and uses it for coloring or clique calculations rather than testing every four-vertex subset..
• Split graph
  • … transfers from A canonical instance directly demonstrates that the finite simple graph admits a vertex partition into a pairwise adjacent clique and a pairwise nonadjacent independent set. 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:41dbda20217b · see in the full table