Packing two copies of a tree into its third power

DOI10.1016/j.disc.2006.04.019zbMath1103.05066OpenAlexW2095438636MaRDI QIDQ2433735

Atsushi Kaneko, Kazuhiro Suzuki

Publication date: 30 October 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.04.019

zbMATH Keywords

tree\(k\)-placeable

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Packing three copies of a tree into its sixth power ⋮ Labeled packing of cycles and circuits

Cites Work

• Unnamed Item
• Packing three copies of a tree into a complete graph
• A note on the ``packing of two copies of some trees into their third power
• Packing two copies of a tree into its fourth power
• On the packing of two copies of a caterpillar in its third power

This page was built for publication: Packing two copies of a tree into its third power