Pages that link to "Item:Q3401108"
From MaRDI portal
The following pages link to New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes (Q3401108):
Displaying 5 items.
- Homomorphisms and colourings of oriented graphs: an updated survey (Q279228) (← links)
- Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs (Q897592) (← links)
- On the oriented coloring of the disjoint union of graphs (Q2115853) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Complexity dichotomy for oriented homomorphism of planar graphs with large girth (Q2355705) (← links)
