Polynomial instances of the Packing Coloring Problem

DOI10.1016/J.ENDM.2011.05.062zbMath1268.05190OpenAlexW2023633659MaRDI QIDQ2840736

Pablo Torres, Gabriela R. Argiroffo, Graciela L. Nasini

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.062

zbMATH Keywords

caterpillarpacking chromatic numberlobsterpartner limited graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Packing coloring of some undirected and oriented coronae graphs ⋮ Dichotomies properties on computational complexity of \(S\)-packing coloring problems

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity of the packing coloring problem for trees
• On the packing chromatic number of some lattices
• Recognizing $P_4 $-Sparse Graphs in Linear Time
• ON GRAPHS WITH LIMITED NUMBER OF P₄-PARTNERS
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

This page was built for publication: Polynomial instances of the Packing Coloring Problem