Packing chromatic number of subdivisions of cubic graphs

DOI10.1007/s00373-019-02016-3zbMath1409.05080arXiv1803.02537OpenAlexW2963646574WikidataQ128447234 ScholiaQ128447234MaRDI QIDQ1741592

Xujun Liu, József Balogh, Alexandr V. Kostochka

Publication date: 3 May 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

cubic graphsindependent setspacking coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (11)

Packing chromatic numbers of finite super subdivisions of graphs ⋮ Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable ⋮ Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs ⋮ A survey on packing colorings ⋮ \(S\)-packing coloring of cubic Halin graphs ⋮ \(S\)-packing chromatic vertex-critical graphs ⋮ Packing colorings of subcubic outerplanar graphs ⋮ About \(S\)-packing coloring of subcubic graphs ⋮ \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) ⋮ Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs ⋮ Graphs that are critical for the packing chromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• \(S\)-packing colorings of cubic graphs
• Facial packing edge-coloring of plane graphs
• Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
• Packing chromatic number under local changes in a graph
• Complexity of the packing coloring problem for trees
• The packing chromatic number of infinite product graphs
• An infinite family of subcubic graphs with unbounded packing chromatic number
• Packing chromatic number versus chromatic and clique number
• Packing chromatic number of cubic graphs
• On the packing chromatic number of subcubic outerplanar graphs
• The packing chromatic number of hypercubes
• Packing coloring of some undirected and oriented coronae graphs
• Dichotomies properties on computational complexity of \(S\)-packing coloring problems
• The packing coloring problem for lobsters and partner limited graphs
• Packing chromatic number of base-3 Sierpiński graphs
• A note on \(S\)-packing colorings of lattices
• The S-packing chromatic number of a graph
• On the packing chromatic number of square and hexagonal lattice
• Subdivision into i-packings and S-packing chromatic number of some lattices
• 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 chromatic number of subdivisions of cubic graphs