On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs
From MaRDI portal
Publication:3503530
Recommendations
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- On the packing chromatic number of some lattices
- The packing chromatic number of infinite product graphs
- On the packing chromatic number of square and hexagonal lattice
Cites work
Cited in
(13)- On the packing chromatic number of square and hexagonal lattice
- A lower bound for the packing chromatic number of the Cartesian product of cycles
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- Packing chromatic number versus chromatic and clique number
- On uniquely packable trees
- Packing coloring of some product of complete graphs
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- The packing chromatic number of infinite product graphs
- A note on the packing chromatic number of lexicographic products
- On packing colorings of distance graphs
- Partial packing coloring and quasi-packing coloring of the triangular grid
- Packing coloring of some undirected and oriented coronae graphs
- Packing chromatic number of certain fan and wheel related graphs
This page was built for publication: On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503530)