Meyniel graphs are strongly perfect

DOI10.1016/0095-8956(82)90068-5zbMath0498.05055OpenAlexW2090739085MaRDI QIDQ1171076

G. Ravindra

Publication date: 1982

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(82)90068-5

zbMATH Keywords

chromatic numberclique numberperfect graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Alternating orientation and alternating colouration of perfect graphs ⋮ On a conjecture of Meyniel ⋮ A fast algorithm for coloring Meyniel graphs ⋮ Star-cutsets and perfect graphs ⋮ Structural properties of super strongly perfect graphs ⋮ Some properties of minimal imperfect graphs ⋮ Structure of super strongly perfect graphs ⋮ Research problems ⋮ A class of strongly perfect graphs ⋮ Clique-transversal sets of line graphs and complements of line graphs

Cites Work

• On the perfect graph conjecture
• Perfect zero–one matrices
• Unnamed Item
• Unnamed Item

This page was built for publication: Meyniel graphs are strongly perfect