On Subtournaments of a Tournament
From MaRDI portal
Publication:5516700
DOI10.4153/CMB-1966-038-7zbMath0141.41204OpenAlexW2005173957WikidataQ56503962 ScholiaQ56503962MaRDI QIDQ5516700
Publication date: 1966
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cmb-1966-038-7
Related Items
The cycle structure of regular multipartite tournaments, Pancyclic orderings of in-tournaments, On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\), Dicycle cover of Hamiltonian oriented graphs, Vertex 6-pancyclic in-tournaments, On disjoint cycles of the same length in tournaments, Rainbow triangles in arc-colored digraphs, On cycles containing a given arc in regular multipartite tournaments, On complementary cycles in locally semicomplete digraphs, On the number of 7-cycles in regular \(n\)-tournaments, Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d, On cycles through a given vertex in multipartite tournaments, IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES, Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments, Connectivity properties of locally semicomplete digraphs, Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS, Unnamed Item, Vertex-pancyclism in the generalized sum of digraphs, The intersection problem for star designs, Vertex pancyclic in-tournaments, A 16-vertex tournament for which Banks set and Slater set are disjoint, On complete strongly connected digraphs with the least number of 3-cycles, \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs, Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs, Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties, Lichiardopol's conjecture on disjoint cycles in tournaments, Complementary cycles of any length in regular bipartite tournaments, Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2, Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang conjecture, On finite reflexive homomorphism-homogeneous binary relational systems, Regular Hypertournaments and Arc-Pancyclicity, Weakly quasi-Hamiltonian-connected multipartite tournaments, Disjoint cycles in tournaments and bipartite tournaments, Weakly quasi-Hamiltonian-set-connected multipartite tournaments, On an adjacency property of almost all tournaments, Paths with a given number of vertices from each partite set in regular multipartite tournaments, Feedback Vertex Sets in Tournaments, Cycles in \(k\)-traceable oriented graphs, Strong subtournaments of order \(c\) containing a given vertex in regular \(c\)-partite tournaments with \(c\geq 16\), \(c\)-pancyclic partial ordering and \((c-1)\)-pan-outpath partial ordering in semicomplete multipartite digraphs., On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\), On the vertex-pancyclicity of hypertournaments, Pancyclic out-arcs of a vertex in tournaments, Restricted arc-connectivity in tournaments, Complementary cycles in almost regular multipartite tournaments, where one cycle has length four, Unnamed Item, Multipartite tournaments: a survey, Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result, On a cyclic connectivity property of directed graphs, Lengths of words in transformation semigroups generated by digraphs, Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter, Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\), On the likelihood of cyclic comparisons, Cycle factors in strongly connected local tournaments, The volume and foundation of star trades, Pancyclic graphs. II, Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three, Cycles with a given number of vertices from each partite set in regular multipartite tournaments, Hamiltonian tournaments with the least number of 3-cycles, Extending cycles in directed graphs, On 1-factors with prescribed lengths in tournaments, Digraphs with proper connection number two, On arc-traceable local tournaments, Strong subtournaments containing a given vertex in regular multipartite tournaments, Circuits of each length in tournaments, The domination number of round digraphs, On supereulerian 2-edge-coloured graphs, Pancyclic graphs. I, On the number of cycles in local tournaments, Complementary cycles in regular multipartite tournaments, where one cycle has length five, Cycles through a given arc and certain partite sets in almost regular multipartite tournaments, Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments, Vertex deletion and cycles in multipartite tournaments, Basic Terminology, Notation and Results, Tournaments and Semicomplete Digraphs, Semicomplete Multipartite Digraphs, Quasi-Hamiltonian cycles in \(k\)-strong multipartite tournaments, On local characterizations of Hamiltonian tournaments, Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles, Arc-antipancyclic hypertournament
