Graphs that are critical for the packing chromatic number

DOI10.7151/DMGT.2298MaRDI QIDQ2118245zbMATH OpenOpenAlexFDO

Authors Boštjan Brešar, Jasmina Ferme

Publication date 22 March 2022

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.2298

zbMATH Keywords

block graphcritical graphdiameterpacking coloringtree

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Packing chromatic vertex-critical graphs
• \(S\)-packing chromatic vertex-critical graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• A characterization of 4-_S-vertex-critical graphs for packing sequences with s₁ = 1 and s₂ 3
• Packing chromatic number under local changes in a graph

Cites work

• (d, n)-packing colorings of infinite lattices
• An infinite family of subcubic graphs with unbounded packing chromatic number
• Broadcast chromatic numbers of graphs
• Complexity of the packing coloring problem for trees
• Modeling the packing coloring problem of graphs
• Notes on complexity of packing coloring
• On packing colorings of distance graphs
• On the packing chromatic number of subcubic outerplanar graphs
• Packing chromatic number of cubic graphs
• Packing chromatic number of subdivisions of cubic graphs
• Packing chromatic number under local changes in a graph
• Packing chromatic number versus chromatic and clique number
• Packing chromatic vertex-critical graphs
• Packing coloring of generalized Sierpinski graphs
• Packing coloring of Sierpiński-type graphs
• Packing coloring of some undirected and oriented coronae graphs
• Packing colouring of some classes of cubic graphs
• The packing chromatic number of hypercubes
• The packing chromatic number of the infinite square lattice is between 13 and 15
• The packing coloring of distance graphs \(D(k,t)\)

Cited in

(12)

• A survey on packing colorings
• \(S\)-packing chromatic vertex-critical graphs
• Finding the chromatic number by means of critical graphs
• Packing chromatic number of distance graphs
• Packing $k$-Matchings and $k$-Critical Graphs
• Packing chromatic number under local changes in a graph
• Packing chromatic vertex-critical graphs
• A characterization of 4-_S-vertex-critical graphs for packing sequences with s₁ = 1 and s₂ 3
• S-packing chromatic critical graphs
• Bounds for packing chromatic number of some subclasses of trees
• Grundy packing coloring of graphs
• Distance dominator packing coloring of type II

This page was built for publication: Graphs that are critical for the packing chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118245)