Packing two copies of a tree into its third power (Q2433735): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2006.04.019 / rank | |||
| Property / cites work | |||
| Property / cites work: On the packing of two copies of a caterpillar in its third power / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5463508 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the ``packing of two copies of some trees into their third power'' / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Packing two copies of a tree into its fourth power / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Packing three copies of a tree into a complete graph / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2006.04.019 / rank | |||
Normal rank | |||
Latest revision as of 15:50, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing two copies of a tree into its third power |
scientific article |
Statements
Packing two copies of a tree into its third power (English)
0 references
30 October 2006
0 references
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\).
0 references
tree
0 references
\(k\)-placeable
0 references
