Covering 2-paths uniformly

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(2000)8:2<100::AID-JCD3>3.0.CO;2-E" /><100::AID-JCD3>3.0.CO;2-E 10.1002/(SICI)1520-6610(2000)8:2<100::AID-JCD3>3.0.CO;2-EzbMath0946.05022OpenAlexW2061494547MaRDI QIDQ4948740

D. Heinrich, D. Langdeau, Helen Verrall

Publication date: 23 October 2000

Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(2000)8:2<100::aid-jcd3>3.0.co;2-e

zbMATH Keywords

uniform coveringsubgraph-design

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

Embedding coverings of 2-paths with 3-paths ⋮ Double coverings of 2‐paths by Hamilton cycles* ⋮ Uniform coverings of 2-paths with 4-cycles ⋮ On resolvable multipartite \(G\)-designs. II ⋮ Uniform coverings of 2-paths with 5-paths in the complete graph

Cites Work

• Unnamed Item
• Compatible Euler tours for transition systems in Eulerian graphs
• On large sets of disjoint Steiner triple systems. IV
• Exact coverings of 2-paths by 4-cycles
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• Dudeney's round table problem
• Resolvable coverings of 2-paths by 4-cycles
• Exact coverings of 2-paths by Hamilton cycles
• A solution of Dudeney's round table problem for an even number of people
• Cycle decompositions of the line graph of \(K_ n\)
• Pairwise compatible Hamilton decompositions of \(K_n\)
• Hamilton circuits in the directed wrapped Butterfly network
• Compatible Euler tours of \(K_n^{**}\)
• Compatible Eulerian circuits in \(K_ n^{**}\)
• Hamilton cycle decomposition of line graphs and a conjecture of Bermond
• Finite topologies and Hamiltonian paths
• On Quadruple Systems
• Partitioning oriented 2-paths
• On the maximum number of pairwise compatible euler cycles
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• A 1-factorization of the line graphs of complete graphs
• A Construction of a perfect set of Euler tours of K2k+1
• Cycle systems of the line graph of the complete graph

This page was built for publication: Covering 2-paths uniformly