About \(S\)-packing coloring of subcubic graphs

DOI10.1016/j.disc.2024.113917OpenAlexW4391675990MaRDI QIDQ6204334

Olivier Togni, Maidoun Mortada

Publication date: 27 March 2024

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

Full work available at URL: https://doi.org/10.1016/j.disc.2024.113917

zbMATH Keywords

graph coloringcubic graphpacking chromatic number\(S\)-packing coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• \(S\)-packing colorings 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
• An infinite family of subcubic graphs with unbounded packing chromatic number
• Packing chromatic number of cubic graphs
• Packing chromatic number of subdivisions of cubic graphs
• Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
• Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
• Packing colorings of subcubic outerplanar graphs
• Packing coloring of some undirected and oriented coronae graphs
• On packing \(S\)-colorings of subcubic graphs

This page was built for publication: About \(S\)-packing coloring of subcubic graphs