Bypasses in asymmetric digraphs
From MaRDI portal
Publication:2562793
DOI10.1016/0095-8956(74)90041-0zbMath0268.05109OpenAlexW1988630118MaRDI QIDQ2562793
D. P. Roselle, Brian Alspach, K. Brooks Reid
Publication date: 1974
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(74)90041-0
Related Items (12)
On \(d\)-panconnected tournaments with large semidegrees ⋮ Cycles of all lengths in arc-3-cyclic semicomplete digraphs ⋮ Bypaths in tournaments ⋮ Hamiltonian-connected tournaments ⋮ Extremal and Degree Conditions for Path Extendability in Digraphs ⋮ Completely strong path-connected tournaments ⋮ Strongly 4-path-connectivity in almost regular multipartite tournaments ⋮ A problem on arcs without bypasses in tournaments ⋮ Edge sets contained in circuits ⋮ Brian Alspach and his work ⋮ A note on min-max pair in tournaments ⋮ Arc-antipancyclic hypertournament
Cites Work
This page was built for publication: Bypasses in asymmetric digraphs