On uniquely packable trees
From MaRDI portal
Recommendations
- On the Packing Chromatic Number of Trees, Cartesian Products and Some Infinite Graphs
- Complexity of the Packing Coloring Problem for Trees
- Polynomial instances of the packing coloring problem
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
Cites work
- A note on packing chromatic number of the square lattice
- A survey on packing colorings
- An infinite family of subcubic graphs with unbounded packing chromatic number
- Broadcast chromatic numbers of graphs
- Complexity of the packing coloring problem for trees
- Graphs \& digraphs
- Modeling the packing coloring problem of graphs
- On packing colorings of distance graphs
- On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
- On the packing chromatic number of Moore graphs
- On the packing chromatic number of some lattices
- Packing chromatic number of cubic graphs
- Packing chromatic number of subdivisions of cubic graphs
- Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph
- The packing chromatic number of infinite product graphs
- The packing chromatic number of the infinite square grid is 15
- The packing coloring of distance graphs \(D(k,t)\)
This page was built for publication: On uniquely packable trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608730)