Uniform coverings of 2-paths with 5-paths in the complete graph

DOI10.1016/J.DISC.2004.03.019zbMath1073.05057OpenAlexW2041835569MaRDI QIDQ2568483

Chie Nara, Gisaku Nakamura, Midori Kobayashi

Publication date: 10 October 2005

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

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

Mathematics Subject Classification ID

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

Cites Work

• Exact coverings of 2-paths by 4-cycles
• A solution of Dudeney's round table problem for an even number of people
• Covering 2-paths uniformly
• Unnamed Item
• Unnamed Item

This page was built for publication: Uniform coverings of 2-paths with 5-paths in the complete graph