Packing chromatic vertex-critical graphs

zbMath1411.05091arXiv1810.03904MaRDI QIDQ5377230

Douglas F. Rall, Sandi Klavžar

Publication date: 23 May 2019

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

zbMATH Keywords

treecaterpillarvertex-transitive graphCartesian product of graphspacking chromatic numberpacking chromatic vertex-critical graph

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

Packing chromatic numbers of finite super subdivisions of graphs ⋮ A survey on packing colorings ⋮ \(S\)-packing chromatic vertex-critical graphs ⋮ A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\) ⋮ Graphs that are critical for the packing chromatic number

This page was built for publication: Packing chromatic vertex-critical graphs