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

DOI10.1007/978-3-642-32147-4_28zbMATH Open1370.05163OpenAlexW58963464MaRDI QIDQ3167635FDOQ3167635

G. Nasini, Gabriela R. Argiroffo, P. Torres

Publication date: 2 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_28

Recommendations

• Polynomial instances of the packing coloring problem
• Complexity of the packing coloring problem for trees
• Complexity of the Packing Coloring Problem for Trees
• Maximization coloring problems on graphs with few \(P_4\)
• Notes on complexity of packing coloring

zbMATH Keywords

packing chromatic numberpacking coloring\((q, q-4)\) graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (11)

• Packing chromatic number of base-3 Sierpiński graphs
• The packing coloring problem for lobsters and partner limited graphs
• A survey on packing colorings
• Complexity of the packing coloring problem for trees
• Independence number and packing coloring of generalized Mycielski graphs
• Investigating several fundamental properties of random lobster trees and random spider trees
• Dichotomies properties on computational complexity of \(S\)-packing coloring problems
• Packing coloring of some undirected and oriented coronae graphs
• Packing chromatic number of certain fan and wheel related graphs
• The packing chromatic number of hypercubes
• Complexity of the Packing Coloring Problem for Trees

This page was built for publication: The packing coloring problem for \((q,q-4)\) graphs

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