scientific article; zbMATH DE number 1229694

DOI10.1002/(SICI)1520-6610(1998)6:3%3C183::AID-JCD2%3E3.0.CO;2-BMaRDI QIDQ4222136zbMATH OpenFDO

Authors Helen Verrall

Publication date 23 April 1999

Full work available at URL https://doi.org/10.1002/(SICI)1520-6610(1998)6:3%3C183::AID-JCD2%3E3.0.CO;2-B

zbMATH Keywords

Euler tourHamilton decomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A Construction of a perfect set of Euler tours of K2k+1
• Perfect set of Euler tours of \(K_{p,p,p}\)
• Compatible Euler tours of \(K_n^{**}\)
• Euler cycles in \(K_{2m}\) plus perfect matching

Cited in

(16)

• Euler cycles in \(K_{2m}\) plus perfect matching
• Euler tours and a game with dominoes
• Pairwise compatible Hamilton decompositions of K_n
• Euler tours of maximum girth in \(K_{2n+1}\) and \(K_{2n,2n}\)
• Decompositions of line graphs of complete graphs into paths and cycles
• A \(C_5\)-decomposition of the \(\lambda\)-fold line graph of the complete graph
• Graphs as navigational infrastructure for high dimensional data spaces
• Perfect set of Euler tours of \(K_{p,p,p}\)
• Nonexistence of a pair of arc disjoint directed Hamilton cycles on line digraphs of 2-diregular digraphs
• A Construction of a perfect set of Euler tours of K2k+1
• On Hamilton decompositions of line graphs of non-Hamiltonian graphs and graphs without separating transitions
• Covering 2-paths uniformly
• Multidecompositions of line graphs of complete graphs
• Maximum packing and minimum covering of the line graph of the complete graph with kite
• A special construction of complete Euler graphs
• Packings and coverings of lambda-fold line graphs of the complete graph with \(k\)-cycles, for \(k=4,6\)

This page was built for publication:

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