The Packing Coloring Problem for (q,q-4) Graphs
It is known that computing the packing chromatic number of a graph is an NP-hard problem, even when restricted to tree graphs. This fact naturally leads to the search of graph families where this problem is polynomial time solvable.
Babel et al. (2001) showed that a large variety of NP-complete problems can be efficiently solved for the class of (q,q − 4) graphs, for every fixed q.
In this work we show that also to compute the packing chromatic number can be efficiently solved for the class of (q,q − 4) graphs.
Keywordspacking coloring packing chromatic number (q, q–4) graphs
Unable to display preview. Download preview PDF.
- 1.Argiroffo, G., Nasini, G., Torres, P.: Polynomial instances of the Packing Coloring Problem. To appear in Discrete Applied MathematicsGoogle Scholar
- 2.Babel, L.: On the P 4 structure of graphs. Habilitationsschrift, Technische Universitat Munchen (1997)Google Scholar
- 11.Graph Classes, http://www.graphclasses.org/classes/gc_498.html