Precoloring extension of co-Meyniel graphs

DOI10.1007/s00373-007-0724-1zbMath1123.05038arXivcs/0509004OpenAlexW2035377043MaRDI QIDQ995757

Frédéric Maffray, Benjamin Lévêque, Vincent Jost

Publication date: 10 September 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0509004

zbMATH Keywords

perfectnessperfect graphsArtemis graphMeyniel graphPrecoloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Related Items (1)

Coloring Artemis graphs

Cites Work

• The strong perfect graph theorem
• Slim graphs
• Precoloring extension. I: Interval graphs
• Geometric algorithms and combinatorial optimization
• You can't paint yourself into a corner
• Scheduling with incompatible jobs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A class of perfectly contractile graphs
• Graph colorings with local constraints -- a survey
• Approximation results for the optimum cost chromatic partition problem
• Precoloring Extension III: Classes of Perfect Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Precoloring extension of co-Meyniel graphs