Pages that link to "Item:Q4443128"
From MaRDI portal
The following pages link to Acyclic Homomorphisms and Circular Colorings of Digraphs (Q4443128):
Displayed 10 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Paths, cycles and circular colorings in digraphs (Q1019171) (← links)
- On the complexity of \(H\)-colouring planar graphs (Q1045065) (← links)
- The star dichromatic number (Q2062686) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- Convex circuit-free coloration of an oriented graph (Q2519795) (← links)
- On the Complexity of Digraph Colourings and Vertex Arboricity (Q5130735) (← links)
- Constraint Satisfaction Problems with Infinite Templates (Q5504704) (← links)
- Acyclic coloring of products of digraphs (Q6130210) (← links)