On a conjecture of Meyniel

DOI10.1016/0095-8956(87)90047-5zbMath0634.05058OpenAlexW1979280995WikidataQ56430113 ScholiaQ56430113MaRDI QIDQ1096652

Chính T. Hoàng

Publication date: 1987

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(87)90047-5

zbMATH Keywords

perfect graphsMeyniel graph

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (16)

Alternating orientation and alternating colouration of perfect graphs ⋮ Path parity and perfection ⋮ A fast algorithm for coloring Meyniel graphs ⋮ Slim graphs ⋮ Some properties of minimal imperfect graphs ⋮ Structure and algorithms for (cap, even hole)-free graphs ⋮ Perfectly contractile graphs and quadratic toric rings ⋮ Strong cliques in vertex‐transitive graphs ⋮ Coloring vertices of a graph or finding a Meyniel obstruction ⋮ Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs ⋮ Graphs vertex-partitionable into strong cliques ⋮ Strong cliques in diamond-free graphs ⋮ Detecting strong cliques ⋮ Perfectly contractile graphs ⋮ Coloring Meyniel graphs in linear time ⋮ Colouring Some Classes of Perfect Graphs Robustly

Cites Work

• Unnamed Item
• Unnamed Item
• A new property of critical imperfect graphs and some consequences
• The ellipsoid method and its consequences in combinatorial optimization
• Meyniel graphs are strongly perfect
• On the perfect graph conjecture
• Normal hypergraphs and the perfect graph conjecture

This page was built for publication: On a conjecture of Meyniel