Packing colorings of subcubic outerplanar graphs

DOI10.1007/S00010-020-00721-6zbMath1447.05074arXiv1809.05552OpenAlexW3103047118MaRDI QIDQ2198310

Boštjan Brešar, Olivier Togni, Nicolas Gastineau

Publication date: 10 September 2020

Published in: Aequationes Mathematicae (Search for Journal in Brave)

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

zbMATH Keywords

packingcubic graphcoloringouterplanar graphpacking chromatic number

Mathematics Subject Classification ID

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

Related Items (5)

\(S\)-packing coloring of cubic Halin graphs ⋮ On packing \(S\)-colorings of subcubic graphs ⋮ A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\) ⋮ About \(S\)-packing coloring of subcubic graphs ⋮ Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs

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
• On the packing chromatic number of subcubic outerplanar graphs
• Packing chromatic number of subdivisions of cubic graphs
• A lower bound for the packing chromatic number of the Cartesian product of cycles
• Modeling the packing coloring problem of graphs
• The packing chromatic number of hypercubes
• 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
• The packing coloring problem for lobsters and partner limited graphs
• Coloring the square of an outerplanar graph
• Packing chromatic number of base-3 Sierpiński graphs
• Vertex coloring the square of outerplanar graphs of low degree
• On the packing chromatic number of square and hexagonal lattice
• Packing Coloring of Undirected and Oriented Generalized Theta Graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

This page was built for publication: Packing colorings of subcubic outerplanar graphs