Pages that link to "Item:Q897592"
From MaRDI portal
The following pages link to Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs (Q897592):
Displaying 7 items.
- Oriented colourings of graphs with maximum degree three and four (Q1727768) (← links)
- Oriented coloring on recursively defined digraphs (Q2003341) (← links)
- On the oriented coloring of the disjoint union of graphs (Q2115853) (← links)
- Colorings of oriented planar graphs avoiding a monochromatic subgraph (Q2166215) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Convex circuit-free coloration of an oriented graph (Q2519795) (← links)
- The hardness of the functional orientation 2-color problem (Q2848741) (← links)