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

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)

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

(14)

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