Vertex deletion and cycles in multipartite tournaments

DOI10.1016/S0012-365X(99)90145-0zbMATH Open0939.05046OpenAlexW4213278314MaRDI QIDQ1292878FDOQ1292878

Authors 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

cyclesdigraphHamiltonianmultipartite tournamentstrong vertex deletion

Mathematics Subject Classification ID

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

Recommendations

• On cycles through a given vertex in multipartite tournaments
• Vertex-disjoint cycles in bipartite tournaments
• Vertex-disjoint cycles in bipartite tournaments
• Vertex-disjoint cycles in regular tournaments
• scientific article; zbMATH DE number 1782549
• Cycles through \(k\) vertices in bipartite tournaments
• On cycles in multipartite tournaments
• Vertex-disjoint cycles of different lengths in multipartite tournaments
• scientific article; zbMATH DE number 2222001
• Cycles in multipartite tournaments: Results and problems

Cites Work

• scientific article; zbMATH DE number 3885940 (Why is no real title available?)
• Connectivity properties of locally semicomplete digraphs
• Diconnected Orientations and a Conjecture of Las Vergnas
• Locally semicomplete digraphs: A generalization of tournaments
• On Subtournaments of a Tournament
• On cycles through a given vertex in multipartite tournaments
• On multipartite tournaments
• Quasi‐transitive digraphs

Cited In (14)

• Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
• Quasi-Hamiltonian cycles in \(k\)-strong multipartite tournaments
• Three supplements to Reid's theorem in multipartite tournaments
• Weakly quasi-Hamiltonian-set-connected multipartite tournaments
• Multipartite tournaments: a survey
• Pancyclic out-arcs of a vertex in oriented graphs
• Non-critical vertices and long circuits in strong tournaments of order \(n\) and diameter \(d\)
• Vertex-disjoint cycles of different lengths in multipartite tournaments
• Weakly quasi-Hamiltonian-connected multipartite tournaments
• Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
• Quasi-hamiltonian paths in semicomplete multipartite digraphs
• Weakly cycle complementary 3-partite tournaments
• Componentwise complementary cycles in multipartite tournaments
• Hoàng-Reed conjecture holds for tournaments

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

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