Duality and perfection for edges in cliques

DOI10.1016/0095-8956(84)90035-2zbMATH Open0527.05032OpenAlexW2018115778MaRDI QIDQ595674FDOQ595674

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

• A characterization of perfect graphs
• Graph theory with applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)

• Recognizing edge clique graphs among interval graphs and probe interval graphs
• On the generalized Helly property of hypergraphs, cliques, and bicliques
• Infinite \(\Phi\)-periodic graphs
• Gallai graphs and anti-Gallai graphs
• Edge-clique graphs
• Title not available (Why is that?)
• 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)