Vertex deletion and cycles in multipartite tournaments

DOI10.1016/S0012-365X(99)90145-0zbMath0939.05046OpenAlexW4213278314MaRDI QIDQ1292878

Meike Tewes, Lutz Volkmann

Publication date: 5 July 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90145-0

zbMATH Keywords

digraphHamiltoniancyclesmultipartite tournamentstrong vertex deletion

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (12)

Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d ⋮ Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs ⋮ Weakly quasi-Hamiltonian-connected multipartite tournaments ⋮ Weakly quasi-Hamiltonian-set-connected multipartite tournaments ⋮ Quasi-hamiltonian paths in semicomplete multipartite digraphs ⋮ Pancyclic out-arcs of a vertex in oriented graphs ⋮ Weakly cycle complementary 3-partite tournaments ⋮ Hoàng-Reed conjecture holds for tournaments ⋮ Multipartite tournaments: a survey ⋮ Componentwise complementary cycles in multipartite tournaments ⋮ Three supplements to Reid's theorem in multipartite tournaments ⋮ Quasi-Hamiltonian cycles in \(k\)-strong multipartite tournaments

Cites Work

• Unnamed Item
• On multipartite tournaments
• On cycles through a given vertex in multipartite tournaments
• Locally semicomplete digraphs: A generalization of tournaments
• Diconnected Orientations and a Conjecture of Las Vergnas
• Connectivity properties of locally semicomplete digraphs
• Quasi‐transitive digraphs
• On Subtournaments of a Tournament

This page was built for publication: Vertex deletion and cycles in multipartite tournaments