Graphs that are critical for the packing chromatic number
From MaRDI portal
Publication:2118245
DOI10.7151/DMGT.2298zbMath1485.05050OpenAlexW3004129935MaRDI QIDQ2118245
Publication date: 22 March 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2298
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (2)
A survey on packing colorings ⋮ 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
- Packing chromatic number under local changes in a graph
- The packing chromatic number of the infinite square lattice is between 13 and 15
- Complexity of the packing coloring problem for trees
- Packing coloring of Sierpiński-type graphs
- An infinite family of subcubic graphs with unbounded packing chromatic number
- Notes on complexity of packing coloring
- Packing chromatic number versus chromatic and clique number
- Packing chromatic number of cubic graphs
- \((d, n)\)-packing colorings of infinite lattices
- On the packing chromatic number of subcubic outerplanar graphs
- Packing chromatic number of subdivisions of cubic graphs
- Modeling the packing coloring problem of graphs
- The packing chromatic number of hypercubes
- Packing coloring of some undirected and oriented coronae graphs
- The packing coloring of distance graphs \(D(k,t)\)
- On packing colorings of distance graphs
- Packing colouring of some classes of cubic graphs
- Packing coloring of generalized Sierpinski graphs
- Packing chromatic vertex-critical graphs
This page was built for publication: Graphs that are critical for the packing chromatic number