Pages that link to "Item:Q5361236"
From MaRDI portal
The following pages link to Planar Digraphs of Digirth Four are 2-Colorable (Q5361236):
Displaying 21 items.
- Small feedback vertex sets in planar digraphs (Q528978) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Cuts in matchings of 3-connected cubic graphs (Q1633599) (← links)
- Cycle reversions and dichromatic number in tournaments (Q1715622) (← links)
- The diachromatic number of digraphs (Q1784278) (← links)
- A note on coloring digraphs of large girth (Q2004076) (← links)
- Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
- The chromatic polynomial of a digraph (Q2056880) (← links)
- The star dichromatic number (Q2062686) (← links)
- Dichromatic number and forced subdivisions (Q2072176) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth (Q2094884) (← links)
- On the dichromatic number of surfaces (Q2121762) (← links)
- The digrundy number of digraphs (Q2142695) (← links)
- The minimum number of edges in 4-critical digraphs of given order (Q2175801) (← links)
- Complete acyclic colorings (Q2185231) (← links)
- Reducing the dichromatic number via cycle reversions in infinite digraphs (Q2225401) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Hajós and Ore constructions for digraphs (Q2309234) (← links)
- Decomposing and colouring some locally semicomplete digraphs (Q2674564) (← links)
- Four proofs of the directed Brooks' theorem (Q6091815) (← links)
