Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs

DOI10.1016/j.dam.2020.03.015zbMath1442.05063arXiv1911.03824OpenAlexW3011206457MaRDI QIDQ2192116

Xujun Liu, Gexin Yu, Runrun Liu, Martin Rolek

Publication date: 29 June 2020

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

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

zbMATH Keywords

independent setssubcubic graphsmaximum average degreepacking coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

A survey on packing colorings, 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, On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\), \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\), Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs

Cites Work

• Unnamed Item
• 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
• Packing chromatic number of subdivisions of cubic 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
• Packing Coloring of Undirected and Oriented Generalized Theta Graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees