Duality and perfection for edges in cliques

DOI10.1016/0095-8956(84)90035-2zbMath0527.05032OpenAlexW2018115778MaRDI QIDQ595674

Karen L. Collins, Michael O. Albertson

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90035-2

zbMATH Keywords

independence numberchromatic numberperfect graphsclique covering numberfour color theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (7)

Infinite \(\Phi\)-periodic graphs ⋮ Gallai graphs and anti-Gallai graphs ⋮ On the generalized Helly property of hypergraphs, cliques, and bicliques ⋮ Edge-clique graphs ⋮ Characterization and recognition of generalized clique-Helly graphs ⋮ Recognizing edge clique graphs among interval graphs and probe interval graphs ⋮ Unnamed Item

Cites Work

• On a clique covering problem of Orlin
• On clique covers and independence numbers of graphs
• A characterization of perfect graphs
• The Strong Perfect Graph Conjecture for Planar Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Duality and perfection for edges in cliques