Pages that link to "Item:Q1836671"
From MaRDI portal
The following pages link to The dichromatic number of a digraph (Q1836671):
Displayed 16 items.
- A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments (Q960957) (← links)
- Eigenvalues and colorings of digraphs (Q962116) (← links)
- Directed defective asymmetric graph coloring games (Q968138) (← links)
- Lightness of digraphs in surfaces and directed game chromatic number (Q1025549) (← links)
- On kernel-perfect critical digraphs (Q1076036) (← links)
- Uniquely colourable m-dichromatic oriented graphs (Q1088673) (← links)
- On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
- Extending kernel perfect digraphs to kernel perfect critical digraphs (Q1182966) (← links)
- Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (Q1195481) (← 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)
- Spectral radius of digraphs with given dichromatic number (Q2431161) (← links)
- Infinite families of -dichromatic vertex critical circulant tournaments (Q3439577) (← links)
- On a Conjecture of Víctor Neumann-Lara (Q3503552) (← links)
- (Q4953557) (← links)