HOLES AND DOMINOES IN MEYNIEL GRAPHS

DOI10.1142/S0129054199000113zbMath1320.05097MaRDI QIDQ5248996

F. Roussel, Irena Rusu

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Structure and algorithms for (cap, even hole)-free graphs ⋮ Coloring vertices of a graph or finding a Meyniel obstruction ⋮ Classes of perfect graphs ⋮ On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem ⋮ Recognition of quasi-Meyniel graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ Coloring Meyniel graphs in linear time

Cites Work

• A new property of critical imperfect graphs and some consequences
• A fast algorithm for coloring Meyniel graphs
• On the perfect graph conjecture
• Transitiv orientierbare Graphen

This page was built for publication: HOLES AND DOMINOES IN MEYNIEL GRAPHS