Packing chromatic numbers of finite super subdivisions of graphs
From MaRDI portal
Publication:5081175
DOI10.2298/FIL2010275LzbMath1499.05222arXiv2001.00469OpenAlexW3136506936MaRDI QIDQ5081175
Moncef Abbas, Jasmina Ferme, Rachid Lemdani
Publication date: 13 June 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.00469
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- 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 the infinite square lattice is between 13 and 15
- Complexity of the packing coloring problem for trees
- On the packing chromatic number of some lattices
- 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
- 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
- The packing coloring of distance graphs \(D(k,t)\)
- On the packing chromatic number of square and hexagonal lattice
- Packing colouring of some classes of cubic graphs
- Packing coloring of generalized Sierpinski graphs
- Packing chromatic vertex-critical graphs
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
This page was built for publication: Packing chromatic numbers of finite super subdivisions of graphs
