Clique-inverse graphs ofK3-free andK4-free graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200012)35:4<257::AID-JGT3>3.0.CO;2-4" /><257::AID-JGT3>3.0.CO;2-4 10.1002/1097-0118(200012)35:4<257::AID-JGT3>3.0.CO;2-4zbMath0966.05055OpenAlexW2003031589MaRDI 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

zbMATH Keywords

characterizationclique graphclique-inverse graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Split clique graph complexity ⋮ Characterization and recognition of generalized clique-Helly graphs ⋮ The P versus NP-complete dichotomy of some challenging problems in graph theory ⋮ The complexity of clique graph recognition ⋮ Unnamed Item

This page was built for publication: Clique-inverse graphs ofK3-free andK4-free graphs