Packing chromatic number under local changes in a graph
From MaRDI portal
Publication:512610
DOI10.1016/j.disc.2016.09.030zbMath1357.05037arXiv1608.05577OpenAlexW2527648042MaRDI QIDQ512610
Sandi Klavžar, Kirsti Wash, Boštjan Brešar, Douglas F. Rall
Publication date: 27 February 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.05577
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (24)
Packing coloring of Sierpiński-type graphs ⋮ An infinite family of subcubic graphs with unbounded packing chromatic number ⋮ Packing chromatic number versus chromatic and clique number ⋮ Independence number and packing coloring of generalized Mycielski graphs ⋮ Packing chromatic numbers of finite super subdivisions of graphs ⋮ On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs ⋮ Packing chromatic number of cubic graphs ⋮ Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable ⋮ The exponential growth of the packing chromatic number of iterated Mycielskians ⋮ Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs ⋮ A survey on packing colorings ⋮ \(S\)-packing coloring of cubic Halin graphs ⋮ On packing \(S\)-colorings of subcubic graphs ⋮ Packing colorings of subcubic outerplanar graphs ⋮ About \(S\)-packing coloring of subcubic 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 ⋮ Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph ⋮ Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs ⋮ Packing colouring of some classes of cubic graphs ⋮ On \(S\)-packing edge-colorings of graphs with small edge weight ⋮ Graphs that are critical for the packing chromatic number
Cites Work
- \(S\)-packing colorings of cubic graphs
- Complexity of the packing coloring problem for trees
- The packing chromatic number of infinite product graphs
- A lower bound for the packing chromatic number of the Cartesian product of cycles
- Modeling the packing coloring problem of graphs
- The packing chromatic number of hypercubes
- The packing coloring of distance graphs \(D(k,t)\)
- On packing colorings of distance graphs
- The packing coloring problem for lobsters and partner limited graphs
- Packing chromatic number of base-3 Sierpiński graphs
- On the packing chromatic number of square and hexagonal lattice
- Some large graphs with given degree and diameter
- Packing Coloring of Undirected and Oriented Generalized Theta Graphs
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- Unnamed Item
- Unnamed Item
This page was built for publication: Packing chromatic number under local changes in a graph