Clique-critical graphs: maximum size and recognition

DOI10.1016/J.DAM.2006.03.024MaRDI QIDQ2500528zbMATHzbMATHOpenAlexFDO

Authors L. Alcón

Publication date 17 August 2006

Published in Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

clique graphsNP-complete problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Critical graphs for clique-coloring
• Clique Graph Recognition Is NP-Complete
• The complexity of clique graph recognition
• On clique-complete graphs
• scientific article; zbMATH DE number 2096431

Cites work

• scientific article; zbMATH DE number 2096431 (Why is no real title available?)
• A characterization of clique graphs
• On clique-complete graphs
• On clique-critical graphs

Cited in

(6)

• On the clique behavior of circulants with three small jumps
• Critical graphs for clique-coloring
• Intersection graph of maximal stars
• Random Graphs, Retractions and Clique Graphs
• The complexity of clique graph recognition
• Edge contraction and edge removal on iterated clique graphs

This page was built for publication: Clique-critical graphs: maximum size and recognition

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