Pages that link to "Item:Q1343264"

The following pages link to The 3 and 4-dichromatic tournaments of minimum order (Q1343264):

Displaying 14 items.

• The dichromatic number of infinite families of circulant tournaments (Q503681) (← links)
• The edge density of critical digraphs (Q519953) (← links)
• A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments (Q960957) (← links)
• The acyclic disconnection of a digraph (Q1292866) (← links)
• A short proof of a theorem of Reid and Parker on tournaments (Q1343229) (← links)
• Vertex critical 4-dichromatic circulant tournaments (Q1363679) (← links)
• The chromatic polynomial of a digraph (Q2056880) (← links)
• On the dichromatic number of surfaces (Q2121762) (← links)
• The dichromatic polynomial of a digraph (Q2127720) (← links)
• The minimum number of edges in 4-critical digraphs of given order (Q2175801) (← links)
• Hajós and Ore constructions for digraphs (Q2309234) (← links)
• DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER (Q2971041) (← links)
• Infinite families of -dichromatic vertex critical circulant tournaments (Q3439577) (← links)
• The smallest 5-chromatic tournament (Q6076253) (← links)