On split clique graphs

MaRDI QIDQ2918477zbMATH OpenFDO

Authors L. Alcón, M. Gutierrez, Luerbio Faria, Celina M. H. de Figueiredo

Publication date 6 October 2012

Published in Matemática Contemporânea (Search for Journal in Brave)

zbMATH Keywords

clique graph recognition problemcomplete set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Split clique graph complexity
• Split clique graph complexity
• The complexity of clique graph recognition
• Clique Graph Recognition Is NP-Complete
• On clique partitions of split graphs

Cited in

(11)

• The complexity of clique graph recognition
• On clique partitions of split graphs
• On splitting the Clebsch graph
• On clique divergent graphs with linear growth
• Biclique graphs of split graphs
• On class 2 split graphs
• Split clique graph complexity
• Clique Graph Recognition Is NP-Complete
• Split clique graph complexity
• Characterizing clique graphs of chordal comparability graphs
• scientific article; zbMATH DE number 5194482 (Why is no real title available?)

This page was built for publication: On split clique graphs

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