Packing coloring of some product of complete graphs
From MaRDI portal
Publication:3382897
zbMATH Open1488.05196MaRDI QIDQ3382897FDOQ3382897
Authors: K. Rajalakshmi, Venkatachalam, Muruga Boopathi Barani, Dafik
Publication date: 22 September 2021
Full work available at URL: http://annales-math.elte.hu/annales63-2020/
Recommendations
- Packing chromatic number of certain fan and wheel related graphs
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- A note on the packing chromatic number of lexicographic products
- On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs
Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Cited In (1)
This page was built for publication: Packing coloring of some product of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3382897)