Cliques and extended triangles. A necessary condition for planar clique graphs
From MaRDI portal
Publication:1827850
DOI10.1016/S0166-218X(03)00369-XzbMath1043.05086MaRDI QIDQ1827850
Marisa Gutierrez, Liliana Alcón
Publication date: 6 August 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
The Helly property on subfamilies of limited size ⋮ Split clique graph complexity ⋮ The P versus NP-complete dichotomy of some challenging problems in graph theory ⋮ The complexity of clique graph recognition ⋮ Split Clique Graph Complexity
Cites Work
This page was built for publication: Cliques and extended triangles. A necessary condition for planar clique graphs