Packing two copies of a tree into its third power

DOI10.1016/J.DISC.2006.04.019MaRDI QIDQ2433735zbMATH OpenOpenAlexFDO

Authors 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

\(k\)-placeabletree

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)

Review text

A graph \(H\) of order \(n\) is \(k\)-placeable into a graph \(G\) of order \(n\), if \(G\) contains \(k\) edge-disjoint copies of \(H\). \textit{H. Khedoucci, J.-F. Saclé} and \textit{M. Woźniak} [Discrete Math. 213, 169--178 (2000; Zbl 0956.05080)] proved that any non-star tree \(T\) is 2-placeable into \(T^4\). The present paper shows that this \(T\) is 2-placeable even into \(T^3\).

Recommendations

• Packing three copies of a tree into its sixth power
• Packing three copies of a tree into a complete graph
• Packing three copies of a tree into a complete bipartite graph
• A note on the ``packing of two copies of some trees into their third power
• Packing four copies of a tree into a complete graph

Cites work

• A note on the ``packing of two copies of some trees into their third power
• scientific article; zbMATH DE number 2192134 (Why is no real title available?)
• On the packing of two copies of a caterpillar in its third power
• Packing three copies of a tree into a complete graph
• Packing two copies of a tree into its fourth power

Cited in

(14)

• Packing three copies of a tree into a complete graph
• A note on packing of three forests
• A note on the ``packing of two copies of some trees into their third power
• Labeled packing of cycles and circuits
• Packing three copies of a tree into its sixth power
• Packing four copies of a tree into a complete graph
• Packing copies of the n-cube into its third power
• 4-placement of rooted trees
• A note on k-placeable graphs
• On the packing of two copies of a caterpillar in its third power
• Remarks on the placeability of isomorphic trees in a complete graph
• scientific article; zbMATH DE number 2192134 (Why is no real title available?)
• Labeled packing of non star trees into their \(k\) th power, \(k\geq 5\)
• Unstable graphs and packing into fifth power

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433735)