\(S\)-packing chromatic vertex-critical graphs

DOI10.1016/j.dam.2020.04.023zbMath1473.05090arXiv2001.09362OpenAlexW3034254477MaRDI QIDQ2197411

Přemysl Holub, Marko Jakovac, Sandi Klavžar

Publication date: 31 August 2020

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

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

zbMATH Keywords

packing coloring\(S\)-packing coloring\(S\)-packing vertex-critical graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

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

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
• The packing chromatic number of the infinite square lattice is between 13 and 15
• Packing chromatic number of cubic graphs
• On the packing chromatic number of subcubic outerplanar graphs
• Facial packing vertex-coloring of subdivided plane graphs
• On \(S\)-packing edge-colorings of cubic graphs
• Packing chromatic number of subdivisions of cubic graphs
• Modeling the packing coloring problem of graphs
• Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph
• Dichotomies properties on computational complexity of \(S\)-packing coloring problems
• A note on \(S\)-packing colorings of lattices
• The S-packing chromatic number of a graph
• Packing coloring of generalized Sierpinski graphs
• Packing chromatic vertex-critical graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

This page was built for publication: \(S\)-packing chromatic vertex-critical graphs