The following pages link to (Q3882513):
Displaying 29 items.
- Coloring digraphs with forbidden cycles (Q490994) (← links)
- The dichromatic number of infinite families of circulant tournaments (Q503681) (← links)
- Vertex critical r-dichromatic tournaments (Q788737) (← links)
- On kernel-perfect critical digraphs (Q1076036) (← links)
- Uniquely colourable m-dichromatic oriented graphs (Q1088673) (← links)
- Extending kernel perfect digraphs to kernel perfect critical digraphs (Q1182966) (← links)
- The acyclic disconnection of a digraph (Q1292866) (← links)
- The 3 and 4-dichromatic tournaments of minimum order (Q1343264) (← links)
- Vertex critical 4-dichromatic circulant tournaments (Q1363679) (← links)
- Cycle reversions and dichromatic number in tournaments (Q1715622) (← links)
- The dichromatic number of a digraph (Q1836671) (← links)
- Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
- The chromatic polynomial of a digraph (Q2056880) (← links)
- Dichromatic number and forced subdivisions (Q2072176) (← links)
- Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded (Q2094868) (← links)
- A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number (Q2101164) (← links)
- The minimum number of edges in 4-critical digraphs of given order (Q2175801) (← links)
- Problems from the discrete to the continuous. Probability, number theory, graph theory, and combinatorics (Q2250288) (← links)
- Disproof of a conjecture of Neumann-Lara (Q2409837) (← links)
- Convex circuit-free coloration of an oriented graph (Q2519795) (← links)
- (Q3440896) (← links)
- (Q3905312) (← links)
- (Q4198534) (← links)
- (Q5616962) (← links)
- On coloring digraphs with forbidden induced subgraphs (Q6074583) (← links)
- The smallest 5-chromatic tournament (Q6076253) (← links)
- Subdivisions with congruence constraints in digraphs of large chromatic number (Q6183432) (← links)
- Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring (Q6201022) (← links)
- Coloring \(k\)-partite sparse digraphs (Q6546412) (← links)
