On uniquely packable trees

DOI10.2989/16073606.2024.2321259zbMATH Open1547.0508MaRDI QIDQ6608730

Elizabeth Jonck, Unnamed Author, Michael J. Dorfling

Publication date: 20 September 2024

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Packing chromatic number, \((1, 1, 2, 2)\)-colorings, and characterizing the Petersen graph
• Complexity of the packing coloring problem for trees
• On the packing chromatic number of some lattices
• The packing chromatic number of infinite product graphs
• An infinite family of subcubic graphs with unbounded packing chromatic number
• Packing chromatic number of cubic graphs
• Packing chromatic number of subdivisions of cubic graphs
• Modeling the packing coloring problem of graphs
• A survey on packing colorings
• On the packing chromatic number of Moore graphs
• A note on packing chromatic number of the square lattice
• The packing coloring of distance graphs \(D(k,t)\)
• On packing colorings of distance graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
• The packing chromatic number of the infinite square grid is 15

This page was built for publication: On uniquely packable trees