Pages that link to "Item:Q4111597"
From MaRDI portal
The following pages link to Diconnected Orientations and a Conjecture of Las Vergnas (Q4111597):
Displaying 50 items.
- Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs (Q394200) (← links)
- Coloring digraphs with forbidden cycles (Q490994) (← links)
- Componentwise complementary cycles in multipartite tournaments (Q511099) (← links)
- The radii of n-partite tournaments (Q582300) (← links)
- Weakly cycle complementary 3-partite tournaments (Q659739) (← links)
- The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments (Q708413) (← links)
- Circuits of each length in tournaments (Q742644) (← links)
- Paths with two blocks in \(n\)-chromatic digraphs (Q885298) (← links)
- Weakly quasi-Hamiltonian-connected multipartite tournaments (Q898116) (← links)
- Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture (Q949757) (← links)
- Three supplements to Reid's theorem in multipartite tournaments (Q968149) (← links)
- Every cycle-connected multipartite tournament has a universal arc (Q1011750) (← links)
- Complementary cycles in regular multipartite tournaments, where one cycle has length five (Q1025933) (← links)
- Bounds of the longest directed cycle length for minimal strong digraphs (Q1106239) (← links)
- Variations on the Gallai-Milgram theorem (Q1112833) (← links)
- Vertex deletion and cycles in multipartite tournaments (Q1292878) (← links)
- A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian (Q1356402) (← links)
- On cycles through a given vertex in multipartite tournaments (Q1356700) (← links)
- The cycle structure of regular multipartite tournaments (Q1613369) (← links)
- Bispindles in strongly connected digraphs with large chromatic number (Q1640212) (← links)
- When \(n\)-cycles in \(n\)-partite tournaments are longest cycles (Q1763349) (← links)
- Complementary cycles in irregular multipartite tournaments (Q1793296) (← links)
- All regular multipartite tournaments that are cycle complementary (Q1827717) (← links)
- Diperfect graphs (Q1838975) (← links)
- On three blocks paths \(P (k, l, r)\) (Q2081489) (← links)
- Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number (Q2092433) (← links)
- Cycles and new bounds for the chromatic number (Q2111913) (← links)
- Subdivisions of four blocks cycles in digraphs with large chromatic number (Q2235256) (← links)
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey (Q2277468) (← links)
- Quasi-Hamiltonian cycles in \(k\)-strong multipartite tournaments (Q2342388) (← links)
- Infinite quasi-transitive digraphs with domination number 2 (Q2357773) (← links)
- Bispindle in strongly connected digraphs with large chromatic number (Q2413152) (← links)
- Berge's conjecture on directed path partitions -- a survey (Q2433711) (← links)
- Paths with a given number of vertices from each partite set in regular multipartite tournaments (Q2433729) (← links)
- Complementary cycles in almost regular multipartite tournaments, where one cycle has length four (Q2446860) (← links)
- Multipartite tournaments: a survey (Q2463897) (← links)
- A remark on cycles through an arc in strongly connected multipartite tournaments (Q2470348) (← links)
- On \(n\)-partite tournaments with unique \(n\)-cycle (Q2502031) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Semicomplete Multipartite Digraphs (Q3120439) (← links)
- Cycles with a given number of vertices from each partite set in regular multipartite tournaments (Q3599911) (← links)
- Path Partitions, Cycle Covers and Integer Decomposition (Q3655152) (← links)
- On cycles in regular 3-partite tournaments (Q5920598) (← links)
- On the limit of the sequence \(\{ C^m ( D ) \}_{m = 1}^\infty\) for a multipartite tournament \(D\) (Q6094707) (← links)
- The existence of a path with two blocks in digraphs (Q6121919) (← links)
- Congruence of cycle lengths and chromatic number (Q6143384) (← links)
- Existence of paths with \(t\) blocks in \(k ( t )\)-chromatic digraph (Q6184345) (← links)
- A characterization of rich \(c\)-partite \((c \geq 7)\) tournaments without \((c + 2)\)-cycles (Q6599800) (← links)
- Bounds on maximum weight directed cut (Q6606913) (← links)
- Subdivisions in dicritical digraphs with large order or digirth (Q6612301) (← links)
