Set intersection representations for almost all graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199611)23:3<309::AID-JGT11>3.0.CO;2-9" /><309::AID-JGT11>3.0.CO;2-9 10.1002/(SICI)1097-0118(199611)23:3<309::AID-JGT11>3.0.CO;2-9zbMath0948.05036OpenAlexW4239289377MaRDI QIDQ4715285

David A. Grable, Nancy Eaton

Publication date: 19 November 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199611)23:3<309::aid-jgt11>3.0.co;2-9

zbMATH Keywords

labelsset intersection representation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Towards a comprehensive theory of conflict-tolerance graphs ⋮ Constant tolerance intersection graphs of subtrees of a tree ⋮ On set intersection representations of graphs ⋮ Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets

This page was built for publication: Set intersection representations for almost all graphs