Meyniel graphs are strongly perfect

DOI10.1016/0095-8956(82)90068-5MaRDI QIDQ1171076zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3889565 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• On the perfect graph conjecture
• Perfect zero–one matrices

Cited in

(10)

• A class of strongly perfect graphs
• 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
• Some properties of minimal imperfect graphs
• Structural properties of super strongly perfect graphs
• Structure of super strongly perfect graphs
• Research problems
• Clique-transversal sets of line graphs and complements of line graphs

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

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