Pages that link to "Item:Q2003341"
From MaRDI portal
The following pages link to Oriented coloring on recursively defined digraphs (Q2003341):
Displaying 15 items.
- Orientable edge colorings of graphs (Q531600) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs (Q897592) (← links)
- Oriented colorings of partial 2-trees (Q975406) (← links)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- The knapsack problem with special neighbor constraints (Q2123119) (← links)
- Computing directed Steiner path covers (Q2125222) (← links)
- Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← 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)
- Consecutive colouring of oriented graphs (Q2242444) (← links)
- Chromatic polynomials of oriented graphs (Q2325756) (← links)
- Convex circuit-free coloration of an oriented graph (Q2519795) (← links)
- The parameterized complexity of oriented colouring (Q2917312) (← links)