Characterizing intersection classes of graphs

DOI10.1016/0012-365X(85)90047-0zbMath0597.05056OpenAlexW2003053180MaRDI QIDQ1078582

Edward R. Scheinerman

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(85)90047-0

zbMATH Keywords

intersection graphintersection classintersection representations

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (12)

Recognizing interval digraphs and interval bigraphs in polynomial time ⋮ Bipartite dimensions and bipartite degrees of graphs ⋮ Parikh word representability of bipartite permutation graphs ⋮ On Local Structures of Cubicity 2 Graphs ⋮ Maximum independent set and maximum clique algorithms for overlap graphs ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Intersection properties of graphs ⋮ Counting Perfect Matchings and the Switch Chain ⋮ On uniqueness of a general factorization of graph properties ⋮ Efficient Local Representations of Graphs ⋮ Interval graphs and related topics ⋮ Irrepresentability by multiple intersection, or why the interval number is unbounded

Cites Work

• Random interval graphs
• A characterisation of rigid circuit graphs
• Normal hypergraphs and the perfect graph conjecture
• The intersection graphs of subtrees in trees are exactly the chordal graphs

This page was built for publication: Characterizing intersection classes of graphs