Cycles of Each Length in Regular Tournaments

DOI10.4153/CMB-1967-028-6zbMath0148.43602OpenAlexW2016474956MaRDI QIDQ5527636

Brian Alspach

Publication date: 1967

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cmb-1967-028-6

zbMATH Keywords

topology

Related Items

The cycle structure of regular multipartite tournaments ⋮ Pancyclic arcs and connectivity in tournaments ⋮ On cycles containing a given arc in regular multipartite tournaments ⋮ On \(d\)-panconnected tournaments with large semidegrees ⋮ t-Pancyclic Arcs in Tournaments ⋮ Path-connectivity in local tournaments ⋮ Cycle-pancyclism in tournaments. I ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Cycles of all lengths in arc-3-cyclic semicomplete digraphs ⋮ Cycle-pancyclism in tournaments. II ⋮ Bypaths in tournaments ⋮ Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey ⋮ Hamiltonian-connected tournaments ⋮ Regular Hypertournaments and Arc-Pancyclicity ⋮ \(\mathrm{Quasi}_{\mathrm{ps}}\)-pancyclicity of regular multipartite tournament ⋮ Pancyclic out-arcs of a vertex in tournaments ⋮ Cycles and paths of many lengths in bipartite digraphs ⋮ Cycles of each length in tournaments ⋮ Multipartite tournaments: a survey ⋮ Strongly 4-path-connectivity in almost regular multipartite tournaments ⋮ The number of pancyclic arcs in a k‐strong tournament ⋮ Cycle-pancyclism in tournaments. III ⋮ Arc-Pancyclic Property of Tournaments under Some Degree Conditions ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Pancyclic graphs. II ⋮ Edge sets contained in circuits ⋮ Outpaths of arcs in multipartite tournaments ⋮ Extending cycles in directed graphs ⋮ Circulant tournaments of prime order are tight ⋮ On arc-traceable local tournaments ⋮ Circuits of each length in tournaments ⋮ Pancyclic graphs. I ⋮ An extreme problem concerning k-arc-cyclic property for a class of tournaments ⋮ Cycles in digraphs– a survey ⋮ Cycles containing a given arc in regular multipartite tournaments ⋮ Cycles through a given arc and certain partite sets in almost regular multipartite tournaments ⋮ Bypasses in asymmetric digraphs ⋮ Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments ⋮ The acyclic disconnection of a digraph ⋮ On arc-traceable tournaments ⋮ Brian Alspach and his work ⋮ Tournaments and Semicomplete Digraphs ⋮ A note on min-max pair in tournaments ⋮ Arc-pancyclicity of hypertournaments with irregularity at most two ⋮ Arc-antipancyclic hypertournament