Pages that link to "Item:Q5897986"
From MaRDI portal
The following pages link to SOFSEM 2006: Theory and Practice of Computer Science (Q5897986):
Displaying 11 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)
- Oriented coloring on recursively defined digraphs (Q2003341) (← links)
- On the oriented coloring of the disjoint union of graphs (Q2115853) (← 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)
- Complexity dichotomy for oriented homomorphism of planar graphs with large girth (Q2355705) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
- On the oriented chromatic index of oriented graphs (Q5387018) (← links)
- Equitable oriented coloring (Q6047973) (← links)
