Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments

DOI10.1002/(SICI)1097-0118(199910)32:2%3C123::AID-JGT3%3E3.0.CO;2-YMaRDI QIDQ4700527zbMATH OpenOpenAlexFDO

Authors A. Yeo

Publication date 11 January 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199910)32:2%3C123::aid-jgt3%3E3.0.co;2-y

zbMATH Keywords

Hamilton cycle, multipartite tournament, irregularity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
• Hamiltonian dicycles avoiding prescribed arcs in tournaments
• Hamilton decompositions of regular tournaments
• Hamiltonian Cycles in Regular Tournaments

Cites work

• Cycles in multipartite tournaments: Results and problems
• Graph theory with applications

Cited in

(6)

• Hamiltonian paths containing a given arc, in almost regular bipartite tournaments
• Extremal results on arc-traceable tournaments
• Multipartite tournaments: a survey
• Hamiltonian Cycles in Regular Tournaments
• Semicomplete Multipartite Digraphs
• Hamiltonian dicycles avoiding prescribed arcs in tournaments

This page was built for publication: Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments

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