Edge-decompositions ofKn,ninto isomorphic copies of a given tree

DOI10.1002/JGT.20024MaRDI QIDQ3159387zbMATH OpenOpenAlexFDO

Authors Anna Lladó, S. C. López

Publication date 16 February 2005

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20024

zbMATH Keywords

Häggkvist's conjecturelabelings

Mathematics Subject Classification ID

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

Recommendations

• Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
• scientific article; zbMATH DE number 3505018
• Edge-decomposition of graphs into copies of a tree with four edges
• scientific article; zbMATH DE number 2235052
• scientific article; zbMATH DE number 4168718
• Decomposing the hypercube Q_n into n isomorphic edge-disjoint trees
• Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)
• scientific article; zbMATH DE number 1556732
• On the decomposition of n‐cubes into isomorphic trees
• Almost every tree with \(m\) edges decomposes \(K_{2m,2m}\)

Cites work

• A dynamic survey of graph labeling
• Bipartite labelings of trees and the gracesize
• Distinct Sums Modulo n and Tree Embeddings
• scientific article; zbMATH DE number 4150219 (Why is no real title available?)
• scientific article; zbMATH DE number 3728287 (Why is no real title available?)
• scientific article; zbMATH DE number 3435497 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• New families of graphs that have \(\alpha\)-labelings
• The gracefulness of a class of lobster trees

Cited in

(12)

• On a conjecture of Graham and Häggkvist with the polynomial method
• A substitution theorem for graceful trees and its applications
• A new application of the \(\otimes_h\)-product to \(\alpha\)-labelings
• Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)
• On a Häggkvist's Conjecture with the Polynomial Method
• New attack on Kotzig's conjecture
• Odd harmonious and strongly odd harmonious graphs
• Almost every tree with \(m\) edges decomposes \(K_{2m,2m}\)
• Decomposing almost complete graphs by random trees
• Packing large balanced trees into bipartite graphs
• Decomposition of a complete equipartite graph into gregarious \(\mathcal{Y}_5\) tree
• Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)

This page was built for publication: Edge-decompositions ofK_n,ninto isomorphic copies of a given tree

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