On clique-complete graphs

DOI10.1016/S0012-365X(97)00085-XzbMath0894.05045OpenAlexW1981103638MaRDI QIDQ1382831

Cláudio Leonardo Lucchesi, Jayme Luiz Szwarcfiter, Célia Picinin de Mello

Publication date: 7 September 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00085-x

zbMATH Keywords

clique graphcritical graphclique-completeuniversal vertices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items (13)

Split clique graph complexity ⋮ Iterated Clique Graphs and Contractibility ⋮ Characterization of classical graph classes by weighted clique graphs ⋮ Contractibility and the clique graph operator ⋮ The P versus NP-complete dichotomy of some challenging problems in graph theory ⋮ Clique-critical graphs: maximum size and recognition ⋮ Clique-perfectness of complements of line graphs ⋮ The complexity of clique graph recognition ⋮ Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs ⋮ Unnamed Item ⋮ The clique operator on cographs and serial graphs ⋮ Biclique graphs of split graphs ⋮ Characterization and recognition of Helly circular-arc clique-perfect graphs

Cites Work

• Clique graphs of time graphs
• Clique graphs and Helly graphs
• Convergence of iterated clique graphs
• On clique convergent graphs
• Über iterierte Clique-Graphen
• A partial characterization of clique graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On clique-complete graphs