Covering 2-paths uniformly
DOI10.1002/(SICI)1520-6610(2000)8:2%3C100::AID-JCD3%3E3.0.CO;2-EzbMATH Open0946.05022OpenAlexW2061494547MaRDI QIDQ4948740FDOQ4948740
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
Recommendations
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)
Cites Work
- On Quadruple Systems
- Exact coverings of 2-paths by Hamilton cycles
- Hamilton cycle decomposition of line graphs and a conjecture of Bermond
- A solution of Dudeney's round table problem for an even number of people
- Compatible Euler tours of \(K_n^{**}\)
- Title not available (Why is that?)
- 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
- On large sets of disjoint Steiner triple systems. IV
- Cycle decompositions of the line graph of \(K_ n\)
- Cycle systems of the line graph of the complete graph
- Compatible Euler tours for transition systems in Eulerian graphs
- The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
- Finite topologies and Hamiltonian paths
- Hamilton circuits in the directed wrapped Butterfly network
- Exact coverings of 2-paths by 4-cycles
- Resolvable coverings of 2-paths by 4-cycles
- A 1-factorization of the line graphs of complete graphs
- Dudeney's round table problem
- Pairwise compatible Hamilton decompositions of \(K_n\)
- On the maximum number of pairwise compatible euler cycles
- Compatible Eulerian circuits in \(K_ n^{**}\)
- Partitioning oriented 2-paths
Cited In (6)
- On resolvable multipartite \(G\)-designs. II
- Uniform coverings of 2-paths in the complete bipartite directed graph
- Embedding coverings of 2-paths with 3-paths
- Uniform coverings of 2-paths with 4-cycles
- Double coverings of 2‐paths by Hamilton cycles*
- Uniform coverings of 2-paths with 5-paths in the complete graph
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)
