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

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199910)32:2<123::AID-JGT3>3.0.CO;2-Y" /><123::AID-JGT3>3.0.CO;2-Y 10.1002/(SICI)1097-0118(199910)32:2<123::AID-JGT3>3.0.CO;2-YzbMath0929.05037OpenAlexW4244576735MaRDI QIDQ4700527

Anders Yeo

Publication date: 11 January 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199910)32:2<123::aid-jgt3>3.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)

Related Items (2)

Multipartite tournaments: a survey ⋮ Semicomplete Multipartite Digraphs

Cites Work

• Unnamed Item
• Cycles in multipartite tournaments: Results and problems

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