Clique-inverse graphs ofK3-free andK4-free graphs

DOI10.1002/1097-0118(200012)35:4%3C257::AID-JGT3%3E3.0.CO;2-4MaRDI QIDQ4521494zbMATH OpenOpenAlexFDO

Authors Fábio Protti, Jayme L. Szwarcfiter

Publication date 16 August 2001

Full work available at URL https://doi.org/10.1002/1097-0118(200012)35:4%3C257::aid-jgt3%3E3.0.co;2-4

zbMATH Keywords

characterizationclique graphclique-inverse graph

Mathematics Subject Classification ID

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

Recommendations

• On clique-inverse graphs of graphs with bounded clique number
• scientific article; zbMATH DE number 1750103
• On clique graphs with linear size
• On graphs G for which both G and G are claw-free
• scientific article; zbMATH DE number 2192097

Cited in

(9)

• Split clique graph complexity
• Characterization and recognition of generalized clique-Helly graphs
• On clique-inverse graphs of graphs with bounded clique number
• The P versus NP-complete dichotomy of some challenging problems in graph theory
• scientific article; zbMATH DE number 2230216 (Why is no real title available?)
• scientific article; zbMATH DE number 2192097 (Why is no real title available?)
• The complexity of clique graph recognition
• On clique graphs with linear size
• scientific article; zbMATH DE number 1750103 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521494)