Cycles of Each Length in Regular Tournaments
From MaRDI portal
Publication:5527636
DOI10.4153/CMB-1967-028-6zbMath0148.43602MaRDI QIDQ5527636
Publication date: 1967
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Related Items
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey, The number of pancyclic arcs in a k‐strong tournament, Outpaths of arcs in multipartite tournaments, Extending cycles in directed graphs, Cycle-pancyclism in tournaments. III, An extreme problem concerning k-arc-cyclic property for a class of tournaments, Cycles and paths of many lengths in bipartite digraphs, Circulant tournaments of prime order are tight, On arc-traceable local tournaments, Hamiltonian-connected tournaments, Cycles of each length in tournaments, Pancyclic graphs. II, Edge sets contained in circuits, The acyclic disconnection of a digraph, Path-connectivity in local tournaments, Cycles of all lengths in arc-3-cyclic semicomplete digraphs, Bypaths in tournaments, Cycles containing a given arc in regular multipartite tournaments, The cycle structure of regular multipartite tournaments, Cycles through a given arc and certain partite sets in almost regular multipartite tournaments, On cycles containing a given arc in regular multipartite tournaments, Cycle-pancyclism in tournaments. I, Cycle-pancyclism in tournaments. II, Pancyclic out-arcs of a vertex in tournaments, Multipartite tournaments: a survey, Strongly 4-path-connectivity in almost regular multipartite tournaments, Pancyclic graphs. I, Bypasses in asymmetric digraphs, Brian Alspach and his work, A survey on the linear ordering problem for weighted or unweighted tournaments, Pancyclic arcs and connectivity in tournaments, Arc-Pancyclic Property of Tournaments under Some Degree Conditions, On arc-traceable tournaments, Cycles in digraphs– a survey
