Packing colouring of some classes of cubic graphs
From MaRDI portal
Publication:4622625
zbMath1405.05145arXiv1808.02675MaRDI QIDQ4622625
Publication date: 13 February 2019
Full work available at URL: https://arxiv.org/abs/1808.02675
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
AVD proper edge-coloring of some families of graphs, Packing chromatic numbers of finite super subdivisions of graphs, On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs, A survey on packing colorings, Graphs that are critical for the packing chromatic number
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
- Packing chromatic number under local changes in a graph
- The packing chromatic number of infinite product graphs
- Packing coloring of Sierpiński-type graphs
- An infinite family of subcubic graphs with unbounded packing chromatic number
- Packing chromatic number of cubic graphs
- On the packing chromatic number of subcubic outerplanar graphs
- Packing coloring of some undirected and oriented coronae 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