Set intersection representations for almost all graphs
From MaRDI portal
Publication:4715285
DOI<309::AID-JGT11>3.0.CO;2-9 10.1002/(SICI)1097-0118(199611)23:3<309::AID-JGT11>3.0.CO;2-9zbMath0948.05036MaRDI QIDQ4715285
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
05C35: Extremal problems in graph theory
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Towards a comprehensive theory of conflict-tolerance graphs, Constant tolerance intersection graphs of subtrees of a tree, Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets, On set intersection representations of graphs