Cycles in bipartite tournaments

DOI10.1016/0095-8956(82)90029-6zbMath0465.05035MaRDI 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

cycle; bipartite tournament

Mathematics Subject Classification ID

05C38: Paths and cycles

05C20: Directed graphs (digraphs), tournaments

Related Items

Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP, \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs, Cycles and paths of many lengths in bipartite digraphs, On multipartite tournaments, Alternating cycles and paths in edge-coloured multigraphs: A survey, Cycles and paths in bipartite tournaments with spanning configurations, Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs, Paths with a given number of vertices from each partite set in regular multipartite tournaments, Multipartite tournaments: a survey, Cycles with a given number of vertices from each partite set in regular multipartite tournaments

Cites Work

• 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
• Unnamed Item
• Unnamed Item