Pages that link to "Item:Q1836671"
From MaRDI portal
The following pages link to The dichromatic number of a digraph (Q1836671):
Displaying 12 items.
- The connection of the acyclic disconnection and feedback arc sets -- on an open problem of Figueroa et al.. (Q6494939) (← links)
- Coloring \(k\)-partite sparse digraphs (Q6546412) (← links)
- On spectral properties of digraphs about maximum distance (Q6550905) (← links)
- On the minimum number of arcs in \(k\)-dicritical oriented graphs (Q6561323) (← links)
- Redicolouring digraphs: directed treewidth and cycle-degeneracy (Q6585259) (← links)
- On the dichromatic number of surfaces (Q6604692) (← links)
- Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number (Q6611024) (← links)
- Digraph coloring and distance to acyclicity (Q6614618) (← links)
- Colouring non-even digraphs (Q6621244) (← links)
- Coloring tournaments with few colors: algorithms and complexity (Q6654122) (← links)
- On heroes in digraphs with forbidden induced forests (Q6664146) (← links)
- \((\overrightarrow{P_6}\), triangle)-free digraphs have bounded dichromatic number (Q6671592) (← links)
