Pages that link to "Item:Q2917312"
From MaRDI portal
The following pages link to The parameterized complexity of oriented colouring (Q2917312):
Displaying 7 items.
- A note on the parameterized complexity of unordered maximum tree orientation (Q427909) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Oriented coloring on recursively defined digraphs (Q2003341) (← links)
- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs (Q2232245) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Parameterized mixed graph coloring (Q2424815) (← links)
- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions (Q3540099) (← links)