Duality and perfection for edges in cliques

DOI10.1016/0095-8956(84)90035-2MaRDI QIDQ595674zbMATH OpenOpenAlexFDO

Authors Michael O. Albertson, Karen L. Collins

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

chromatic numberindependence 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)

Cites work

• scientific article; zbMATH DE number 3724488 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3305794 (Why is no real title available?)
• A characterization of perfect graphs
• Graph theory with applications
• On a clique covering problem of Orlin
• On clique covers and independence numbers of graphs
• The Strong Perfect Graph Conjecture for Planar Graphs

Cited in

(7)

• Gallai graphs and anti-Gallai graphs
• On the generalized Helly property of hypergraphs, cliques, and bicliques
• Edge-clique graphs
• Infinite \(\Phi\)-periodic graphs
• Recognizing edge clique graphs among interval graphs and probe interval graphs
• scientific article; zbMATH DE number 2230239 (Why is no real title available?)
• Characterization and recognition of generalized clique-Helly graphs

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

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