Precoloring extension of co-Meyniel graphs

DOI10.1007/S00373-007-0724-1zbMATH Open1123.05038arXivcs/0509004OpenAlexW2035377043MaRDI QIDQ995757FDOQ995757

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

Publication date: 10 September 2007

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

Abstract: The pre-coloring extension problem consists, given a graph $G$ and a subset of nodes to which some colors are already assigned, in finding a coloring of $G$ with the minimum number of colors which respects the pre-coloring assignment. This can be reduced to the usual coloring problem on a certain contracted graph. We prove that pre-coloring extension is polynomial for complements of Meyniel graphs. We answer a question of Hujter and Tuza by showing that ``PrExt perfect graphs are exactly the co-Meyniel graphs, which also generalizes results of Hujter and Tuza and of Hertz. Moreover we show that, given a co-Meyniel graph, the corresponding contracted graph belongs to a restricted class of perfect graphs (``co-Artemis graphs, which are ``co-perfectly contractile graphs), whose perfectness is easier to establish than the strong perfect graph theorem. However, the polynomiality of our algorithm still depends on the ellipsoid method for coloring perfect graphs.

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

Recommendations

• Precoloring Extension III: Classes of Perfect Graphs
• Precoloring extension. I: Interval graphs
• scientific article; zbMATH DE number 1033812
• Precoloring extension on unit interval graphs
• scientific article; zbMATH DE number 772760

zbMATH Keywords

perfect graphsArtemis graphMeyniel graphperfectnessPrecoloring

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Coloring Artemis graphs
• Precoloring Extension for 2‐connected Graphs
• Precoloring extension for 2-connected graphs with maximum degree three
• On the number of precolouring extensions

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

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