On cyclic packing of a tree

DOI10.1007/S00373-004-0583-YMaRDI QIDQ704857zbMATH OpenOpenAlexFDO

Authors Stephan Brandt, Mariusz Woźniak

Publication date 20 January 2005

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-004-0583-y

zbMATH Keywords

Distinct lengths labellingPacking of graphs

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• On the tree packing conjecture
• On the tree packing problem
• Packing trees in complete graphs
• On self-complementary cyclic packing of forests
• Integral packing of trees and branchings
• Generalizations of the tree packing conjecture
• Packing trees with constraints on the leaf degree
• Planar packing of binary trees
• On the minimal packing of a tree with fixed vertices
• An approximate version of the tree packing conjecture

Cited in

(2)

• On self-complementary cyclic packing of forests
• Bi-cyclic decompositions of complete graphs into spanning trees

This page was built for publication: On cyclic packing of a tree

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