A Construction of a perfect set of Euler tours of K2k+1
From MaRDI portal
Publication:4222151
DOI10.1002/(SICI)1520-6610(1997)5:3%3C215::AID-JCD5%3E3.0.CO;2-IzbMATH Open0914.05047OpenAlexW4239512765MaRDI QIDQ4222151FDOQ4222151
Authors:
Publication date: 6 June 1999
Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(1997)5:3%3C215::aid-jcd5%3E3.0.co;2-i
Recommendations
- scientific article; zbMATH DE number 1229694
- Perfect set of Euler tours of \(K_{p,p,p}\)
- Compatible Euler tours of \(K_n^{**}\)
- Euler tours of maximum girth in \(K_{2n+1}\) and \(K_{2n,2n}\)
- Euler cycles in \(K_{2m}\) plus perfect matching
- Euler cycles in the complete graph \(K_{2m+1}\)
- On the construction of Eulerian permutations
- Euler tours in hypergraphs
- A complete solution of Kotzig's problem on the existence of an Euler tour inP-quasigroups
- Cycles containing matchings and pairwise compatible euler tours
Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (15)
- On Hamilton decompositions of line graphs of non-Hamiltonian graphs and graphs without separating transitions
- A \(C_5\)-decomposition of the \(\lambda\)-fold line graph of the complete graph
- Nonexistence of a pair of arc disjoint directed Hamilton cycles on line digraphs of 2-diregular digraphs
- Covering 2-paths uniformly
- Packings and coverings of lambda-fold line graphs of the complete graph with \(k\)-cycles, for \(k=4,6\)
- Multidecompositions of line graphs of complete graphs
- Maximum packing and minimum covering of the line graph of the complete graph with kite
- Perfect set of Euler tours of \(K_{p,p,p}\)
- Title not available (Why is that?)
- Graphs as navigational infrastructure for high dimensional data spaces
- Pairwise compatible Hamilton decompositions of \(K_n\)
- Compatible Euler tours of \(K_n^{**}\)
- Euler tours of maximum girth in \(K_{2n+1}\) and \(K_{2n,2n}\)
- A special construction of complete Euler graphs
- Decompositions of line graphs of complete graphs into paths and cycles
This page was built for publication: A Construction of a perfect set of Euler tours of K2k+1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4222151)
