The packing coloring problem for lobsters and partner limited graphs
From MaRDI portal
Publication:2448872
DOI10.1016/j.dam.2012.08.008zbMath1288.05078OpenAlexW2074404866MaRDI QIDQ2448872
Pablo Torres, Gabriela R. Argiroffo, Graciela L. Nasini
Publication date: 5 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.08.008
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Packing coloring of some undirected and oriented coronae graphs, Packing coloring of Sierpiński-type graphs, Packing chromatic number of base-3 Sierpiński graphs, An infinite family of subcubic graphs with unbounded packing chromatic number, Packing chromatic number versus chromatic and clique number, Independence number and packing coloring of generalized Mycielski graphs, Packing chromatic number of certain fan and wheel related graphs, Investigating several fundamental properties of random lobster trees and random spider trees, Packing chromatic number of cubic graphs, Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs, A survey on packing colorings, Packing colorings of subcubic outerplanar graphs, Packing chromatic number of subdivisions of cubic graphs, Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph, Packing chromatic number under local changes in a graph, Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs, The packing chromatic number of hypercubes
Cites Work
