Clique-inverse graphs ofK3-free andK4-free graphs
From MaRDI portal
Publication:4521494
DOI<257::AID-JGT3>3.0.CO;2-4 10.1002/1097-0118(200012)35:4<257::AID-JGT3>3.0.CO;2-4zbMath0966.05055MaRDI QIDQ4521494
Fábio Protti, Jayme Luiz Szwarcfiter
Publication date: 16 August 2001
Full work available at URL: https://doi.org/10.1002/1097-0118(200012)35:4<257::aid-jgt3>3.0.co;2-4
05C75: Structural characterization of families of graphs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Unnamed Item, Split clique graph complexity, The complexity of clique graph recognition, The P versus NP-complete dichotomy of some challenging problems in graph theory, Characterization and recognition of generalized clique-Helly graphs