The packing coloring problem for lobsters and partner limited graphs

DOI10.1016/J.DAM.2012.08.008MaRDI QIDQ2448872zbMATH OpenOpenAlexFDO

Authors P. Torres, Gabriela R. Argiroffo, G. 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

zbMATH Keywords

packing chromatic numbercaterpillarlobsterpartner limited graph

Mathematics Subject Classification ID

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

Recommendations

• Packing problems in edge-colored graphs
• Packing coloring of Sierpiński-type graphs
• On packing colorings of distance graphs
• Limited Packings in Graphs
• Limited packings in graphs
• Packing coloring of generalized Sierpinski graphs
• Notes on complexity of packing coloring
• Modeling the packing coloring problem of graphs
• A survey on packing colorings
• The packing coloring problem for \((q,q-4)\) graphs

Cites work

• scientific article; zbMATH DE number 2104737 (Why is no real title available?)
• Broadcast chromatic numbers of graphs
• Complexity of the packing coloring problem for trees
• Minimum sum coloring of \(P_{4}\)-sparse graphs
• On graphs with limited number of \(P_{4}\)-partners
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• The packing chromatic number of infinite product graphs

Cited in

(19)

• 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
• A survey on packing colorings
• Packing chromatic number of windmill related graphs and chain silicate networks
• Complexity of the packing coloring problem for trees
• Independence number and packing coloring of generalized Mycielski graphs
• Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
• Packing coloring of Sierpiński-type graphs
• Packing chromatic number of cubic graphs
• Investigating several fundamental properties of random lobster trees and random spider trees
• Packing chromatic number of subdivisions of cubic graphs
• Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
• Packing colorings of subcubic outerplanar graphs
• Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph
• Packing chromatic number under local changes in a graph
• 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

This page was built for publication: The packing coloring problem for lobsters and partner limited graphs

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