A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\)

DOI10.1016/j.dam.2023.05.013zbMath1519.05080arXiv2110.05827OpenAlexW4380200872MaRDI QIDQ6166040

Sandi Klavžar, Xiaopan Lian, Yongtang Shi, Hui Lei

Publication date: 2 August 2023

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

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

zbMATH Keywords

graph coloringdistance in graph\(S\)-packing chromatic number\(S\)-packing coloring\(S\)-packing chromatic vertex-critical graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• On \(S\)-packing edge-colorings of cubic 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
• Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
• A survey on packing colorings
• \(S\)-packing chromatic vertex-critical graphs
• Packing colorings of subcubic outerplanar graphs
• On the packing chromatic number of Moore graphs
• Dichotomies properties on computational complexity of \(S\)-packing coloring problems
• A note on \(S\)-packing colorings of lattices
• Independence number and packing coloring of generalized Mycielski graphs
• A note on the packing chromatic number of lexicographic products
• On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs
• The S-packing chromatic number of a graph
• Packing chromatic vertex-critical graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• On packing \(S\)-colorings of subcubic graphs

This page was built for publication: A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\)