Embedding coverings of 2-paths with 3-paths

DOI10.1016/j.disc.2003.10.029zbMath1051.05028OpenAlexW1963824422MaRDI QIDQ1876693

C. A. Rodger, J. W. McGee

Publication date: 20 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.10.029

zbMATH Keywords

complete graphsembedding problemspath coverings

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Exact coverings of 2-paths by 4-cycles
• Cycle decompositions of the line graph of \(K_ n\)
• A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
• The completion of finite incomplete Steiner triple systems with applications to loop theory
• Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\)
• Small embeddings for partial cycle systems of odd length
• Path coverings with paths
• Small Embeddings for Partial Semisymmetric and Totally Symmetric Quasigroups
• The Doyen?Wilson theorem for minimum coverings with triples
• Covering 2-paths uniformly
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Embedding coverings of 2-paths with 3-paths