scientific article; zbMATH DE number 1229694

DOI10.1002/(SICI)1520-6610(1998)6:3%3C183::AID-JCD2%3E3.0.CO;2-BzbMATH Open0911.05047MaRDI QIDQ4222136FDOQ4222136

Authors: Helen Verrall 

Publication date: 23 April 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

Hamilton decompositionEuler tour

Mathematics Subject Classification ID

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

Cited In (14)

• 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
• A Construction of a perfect set of Euler tours of K2k+1
• 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}\)
• Graphs as navigational infrastructure for high dimensional data spaces
• Pairwise compatible Hamilton decompositions 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:

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