Packing paths in complete graphs

DOI10.1016/j.jctb.2009.08.004zbMath1216.05111MaRDI QIDQ965248

Darryn E. Bryant

Publication date: 21 April 2010

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2009.08.004

zbMATH Keywords

graph decompositions; graph packing; path decompositions

Mathematics Subject Classification ID

05C38: Paths and cycles

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

Related Items

Decompositions of complete graphs into bipartite 2-regular subgraphs, Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges, Decompositions of complete multigraphs into cycles of varying lengths, Vertex-transitive graphs that have no Hamilton decomposition, Decomposition of a complete bipartite multigraph into arbitrary cycle sizes, Small embeddings for partial 5-cycle systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• Packing cycles in complete graphs
• Further results concerning the existence of handcuffed designs
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• On the construction of handcuffed designs
• Graph decompositions, handcuffed prisoners and balanced p-designs
• Solution of fink & straight conjecture on path-perfect complete bipartite graphs
• A survey on the existence ofG-Designs
• Decompositions of highly connected graphs into paths of length 3
• Decompositions of complete graphs into long cycles
• Embedding Partial Steiner Triple Systems
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Handcuffed designs
• A proof of the two-path conjecture