Cycles in bipartite tournaments

DOI10.1016/0095-8956(82)90029-6zbMATH Open0465.05035OpenAlexW1998152641MaRDI QIDQ1154477FDOQ1154477

Authors: L. 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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Theory of Round Robin Tournaments
• Long paths and cycles in oriented graphs
• Cycles in k-strong tournaments
• The graphs for which all strong orientations are hamiltonian

Cited In (15)

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

This page was built for publication: Cycles in bipartite tournaments

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