Paths and cycles containing given arcs, in close to regular multipartite tournaments

DOI10.1016/j.jctb.2007.02.004zbMath1124.05053MaRDI QIDQ2384804

Anders Yeo

Publication date: 10 October 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2007.02.004

zbMATH Keywords

Paths; Cycles; Regularity; Multipartite tournaments

Mathematics Subject Classification ID

05C38: Paths and cycles

05C20: Directed graphs (digraphs), tournaments

05C45: Eulerian and Hamiltonian graphs

Related Items

Pancyclic out-arcs of a vertex in oriented graphs, Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments, Cycle extendability in extended tournaments, Multipartite tournaments: a survey, Strong subtournaments and cycles of multipartite tournaments, Vertex-pancyclism in the generalized sum of digraphs, Semicomplete Multipartite Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles in multipartite tournaments: Results and problems
• Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
• How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
• One-diregular subgraphs in semicomplete multipartite digraphs
• Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• Kings in semicomplete multipartite digraphs
• Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic