Split clique graph complexity

DOI10.1007/978-3-642-25870-1_3MaRDI QIDQ3104760zbMATH OpenOpenAlexFDO

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

Publication date 16 December 2011

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL http://sedici.unlp.edu.ar/handle/10915/84984

zbMATH Keywords

NP-completenessHelly propertysplit graphsclique graph

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1944140 (Why is no real title available?)
• scientific article; zbMATH DE number 851097 (Why is no real title available?)
• scientific article; zbMATH DE number 1409177 (Why is no real title available?)
• A characterization of clique graphs
• A partial characterization of clique graphs
• Clique Graph Recognition Is NP-Complete
• Clique Graphs of Chordal and Path Graphs
• Cliques and extended triangles. A necessary condition for planar clique graphs
• Dually Chordal Graphs
• Graph Classes: A Survey
• Small weight codewords in the LDPC codes arising from linear representations of geometries
• The complexity of clique graph recognition
• Topics in Intersection Graph Theory

Cited in

(5)

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

This page was built for publication: Split clique graph complexity

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