Cycles in bipartite tournaments

DOI10.1016/0095-8956(82)90029-6zbMath0465.05035OpenAlexW1998152641MaRDI QIDQ1154477

Lowell W. Beineke

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90029-6

zbMATH Keywords

cyclebipartite tournament

Mathematics Subject Classification ID

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

Related Items

Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs ⋮ Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs ⋮ Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments ⋮ Sufficient conditions for a balanced bipartite digraph to be even pancyclic ⋮ Paths with a given number of vertices from each partite set in regular multipartite tournaments ⋮ Cycles and paths of many lengths in bipartite digraphs ⋮ On multipartite tournaments ⋮ Multipartite tournaments: a survey ⋮ Vertex-disjoint cycles in bipartite tournaments ⋮ Cycles with a given number of vertices from each partite set in regular multipartite tournaments ⋮ Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP ⋮ Cycles and paths in bipartite tournaments with spanning configurations ⋮ Semicomplete Multipartite Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Cycles in k-strong tournaments
• The graphs for which all strong orientations are hamiltonian
• Long paths and cycles in oriented graphs
• The Theory of Round Robin Tournaments