Covering 2-paths uniformly

DOI10.1002/(SICI)1520-6610(2000)8:2%3C100::AID-JCD3%3E3.0.CO;2-EMaRDI QIDQ4948740zbMATH OpenOpenAlexFDO

Authors 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%3C100::aid-jcd3%3E3.0.co;2-e

zbMATH Keywords

uniform coveringsubgraph-design

Mathematics Subject Classification ID

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

Recommendations

• Uniform coverings of 2-paths in the complete bipartite directed graph
• Uniform coverings of 2-paths with 4-cycles
• Uniform coverings of 2-paths in the complete graph and the complete bipartite graph
• Uniform coverings of 2-paths by 4-paths
• scientific article; zbMATH DE number 2148778

Cites work

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

Cited in

(6)

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

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

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