On the packing chromatic number of subcubic outerplanar graphs

DOI10.1016/j.dam.2018.07.034zbMath1405.05060arXiv1703.05023OpenAlexW2597382651WikidataQ129226746 ScholiaQ129226746MaRDI QIDQ1727741

Přemysl Holub, Olivier Togni, Nicolas Gastineau

Publication date: 20 February 2019

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

Full work available at URL: https://arxiv.org/abs/1703.05023

zbMATH Keywords

outerplanar graphspacking chromatic numbersubcubic graphspacking colouring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (15)

Packing chromatic number of base-3 Sierpiński graphs ⋮ Packing chromatic numbers of finite super subdivisions of graphs ⋮ Packing chromatic number of cubic graphs ⋮ Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs ⋮ A survey on packing colorings ⋮ On packing \(S\)-colorings of subcubic graphs ⋮ \(S\)-packing chromatic vertex-critical graphs ⋮ Packing colorings of subcubic outerplanar graphs ⋮ On the packing chromatic number of Moore graphs ⋮ Packing chromatic number of subdivisions of cubic graphs ⋮ \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) ⋮ Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs ⋮ Packing colouring of some classes of cubic graphs ⋮ On \(S\)-packing edge-colorings of graphs with small edge weight ⋮ Graphs that are critical for the packing chromatic number

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
• The packing chromatic number of the infinite square lattice is between 13 and 15
• Complexity of the packing coloring problem for trees
• On the packing chromatic number of some lattices
• The packing chromatic number of infinite product graphs
• An infinite family of subcubic graphs with unbounded packing chromatic number
• Packing chromatic number of cubic graphs
• \((d, n)\)-packing colorings of infinite lattices
• A lower bound for the packing chromatic number of the Cartesian product of cycles
• A note on packing chromatic number of the square lattice
• The packing coloring of distance graphs \(D(k,t)\)
• On packing colorings of distance graphs
• Packing chromatic number of base-3 Sierpiński graphs
• On the packing chromatic number of square and hexagonal lattice
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

This page was built for publication: On the packing chromatic number of subcubic outerplanar graphs