The Packing Coloring Problem for (q,q-4) Graphs

DOI10.1007/978-3-642-32147-4_28zbMath1370.05163OpenAlexW58963464MaRDI QIDQ3167635

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (8)

Packing coloring of some undirected and oriented coronae graphs ⋮ Packing chromatic number of base-3 Sierpiński graphs ⋮ Independence number and packing coloring of generalized Mycielski graphs ⋮ Dichotomies properties on computational complexity of \(S\)-packing coloring problems ⋮ Packing chromatic number of certain fan and wheel related graphs ⋮ Investigating several fundamental properties of random lobster trees and random spider trees ⋮ A survey on packing colorings ⋮ The packing chromatic number of hypercubes

This page was built for publication: The Packing Coloring Problem for (q,q-4) Graphs