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

DOI10.1002/jgt.20024zbMath1063.05110OpenAlexW2527741272MaRDI QIDQ3159387

Susana-Clara López, Anna S. Lladó

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

labelingsHäggkvist's conjecture

Mathematics Subject Classification ID

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

Related Items (10)

Unnamed Item ⋮ A new application of the \(\otimes_h\)-product to \(\alpha\)-labelings ⋮ On a Häggkvist's Conjecture with the Polynomial Method ⋮ Decomposing almost complete graphs by random trees ⋮ Almost Every Tree With m Edges Decomposes K_2m,2m ⋮ Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) ⋮ Unnamed Item ⋮ On a conjecture of Graham and Häggkvist with the polynomial method ⋮ A substitution theorem for graceful trees and its applications ⋮ New attack on Kotzigs conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The gracefulness of a class of lobster trees
• New families of graphs that have \(\alpha\)-labelings
• A dynamic survey of graph labeling
• Bipartite labelings of trees and the gracesize
• Distinct Sums Modulo n and Tree Embeddings

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