The packing coloring problem for (q,q-4) graphs

Authors:
G. Argiroffo;G. Nasini;P. Torres
Affiliations:
Facultad de Ciencias Exactas, Ingeniería y Agrimensura, Universidad Nacional de Rosario, Argentina;Facultad de Ciencias Exactas, Ingeniería y Agrimensura, Universidad Nacional de Rosario, Argentina,CONICET, Argentina;Facultad de Ciencias Exactas, Ingeniería y Agrimensura, Universidad Nacional de Rosario, Argentina,CONICET, Argentina
Venue:
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Year:
2012

Citing 7
Cited 0

Recognizing P4-sparse graphs in linear time

SIAM Journal on Computing
A tree representation for P4-sparse graphs

Discrete Applied Mathematics
P-Components and the Homogeneous Decomposition of Graphs

SIAM Journal on Discrete Mathematics
On the structure of graphs with few P4s

Discrete Applied Mathematics
Upper bounds to the clique width of graphs

Discrete Applied Mathematics
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

Discrete Applied Mathematics
Complexity of the packing coloring problem for trees

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.