Packing paths in complete graphs

DOI10.1016/J.JCTB.2009.08.004MaRDI QIDQ965248zbMATH OpenOpenAlexFDO

Authors Darryn 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 decompositionsgraph packingpath decompositions

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 812067
• Packing circuits into \(K_N\).
• Packing almost stars into the complete graph
• Maximum packings and minimum coverings of multigraphs with paths and stars
• scientific article; zbMATH DE number 4145943

Cites work

• scientific article; zbMATH DE number 554067 (Why is no real title available?)
• A proof of the two-path conjecture
• A survey on the existence ofG-Designs
• Cycle decompositions of complete graphs
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• Decompositions of complete graphs into long cycles
• Decompositions of highly connected graphs into paths of length 3
• Embedding Partial Steiner Triple Systems
• Further results concerning the existence of handcuffed designs
• Graph decompositions, handcuffed prisoners and balanced p-designs
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Handcuffed designs
• On the construction of handcuffed designs
• Packing cycles in complete graphs
• Solution of fink & straight conjecture on path-perfect complete bipartite graphs
• The wonderful Walecki construction

Cited in

(19)

• Decomposition of a complete bipartite multigraph into arbitrary cycle sizes
• Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
• Vertex-transitive graphs that have no Hamilton decomposition
• Decompositions of complete multigraphs into stars of varying sizes
• Decompositions of complete graphs into bipartite 2-regular subgraphs
• Odd path packings
• Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations
• Packing Digraphs with Directed Closed Trails
• Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
• Hamilton path decompositions of complete multipartite graphs
• Decompositions of complete multigraphs into cycles of varying lengths
• Small embeddings for partial 5-cycle systems
• The path set packing problem
• Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
• Minimal path decomposition of complete bipartite graphs
• Packings and 2-packings of A-paths
• Packing paths of length at least two
• Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges
• Decompositions of line graphs of complete graphs into paths and cycles

This page was built for publication: Packing paths in complete graphs

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