Diconnected Orientations and a Conjecture of Las Vergnas
From MaRDI portal
Publication:4111597
DOI10.1112/jlms/s2-14.2.277zbMath0344.05124OpenAlexW2045473475WikidataQ123149225 ScholiaQ123149225MaRDI QIDQ4111597
Publication date: 1976
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-14.2.277
Related Items
Infinite quasi-transitive digraphs with domination number 2, The cycle structure of regular multipartite tournaments, Bispindles in strongly connected digraphs with large chromatic number, A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian, On cycles through a given vertex in multipartite tournaments, Bounds of the longest directed cycle length for minimal strong digraphs, Variations on the Gallai-Milgram theorem, Bispindle in strongly connected digraphs with large chromatic number, Paths with two blocks in \(n\)-chromatic digraphs, Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs, On the limit of the sequence \(\{ C^m ( D ) \}_{m = 1}^\infty\) for a multipartite tournament \(D\), The existence of a path with two blocks in digraphs, Weakly quasi-Hamiltonian-connected multipartite tournaments, Congruence of cycle lengths and chromatic number, Existence of paths with \(t\) blocks in \(k ( t )\)-chromatic digraph, Berge's conjecture on directed path partitions -- a survey, Paths with a given number of vertices from each partite set in regular multipartite tournaments, Complementary cycles in almost regular multipartite tournaments, where one cycle has length four, Weakly cycle complementary 3-partite tournaments, Coloring digraphs with forbidden cycles, Subdivisions of four blocks cycles in digraphs with large chromatic number, Multipartite tournaments: a survey, Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture, A remark on cycles through an arc in strongly connected multipartite tournaments, Componentwise complementary cycles in multipartite tournaments, Three supplements to Reid's theorem in multipartite tournaments, When \(n\)-cycles in \(n\)-partite tournaments are longest cycles, The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments, Cycles with a given number of vertices from each partite set in regular multipartite tournaments, On \(n\)-partite tournaments with unique \(n\)-cycle, Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey, The radii of n-partite tournaments, On cycles in regular 3-partite tournaments, Complementary cycles in irregular multipartite tournaments, Circuits of each length in tournaments, Every cycle-connected multipartite tournament has a universal arc, Complementary cycles in regular multipartite tournaments, where one cycle has length five, All regular multipartite tournaments that are cycle complementary, Path Partitions, Cycle Covers and Integer Decomposition, On three blocks paths \(P (k, l, r)\), Vertex deletion and cycles in multipartite tournaments, Diperfect graphs, Tournaments and Semicomplete Digraphs, Semicomplete Multipartite Digraphs, Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number, Quasi-Hamiltonian cycles in \(k\)-strong multipartite tournaments, Cycles and new bounds for the chromatic number
