Pages that link to "Item:Q1727768"
From MaRDI portal
The following pages link to Oriented colourings of graphs with maximum degree three and four (Q1727768):
Displaying 10 items.
- Colourings of oriented connected cubic graphs (Q785820) (← links)
- Pushable chromatic number of graphs with degree constraints (Q2219941) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Oriented cliques and colorings of graphs with low maximum degree (Q2305935) (← links)
- Chromatic polynomials of oriented graphs (Q2325756) (← links)
- An oriented colouring of planar graphs with girth at least 4 (Q2498117) (← links)
- Coloring graphs in oriented coloring of cubic graphs (Q2674380) (← links)
- Obstructions to injective oriented colourings (Q2857412) (← links)
- The 3-Colorability Problem on Graphs with Maximum Degree Four (Q4429678) (← links)
- Equitable oriented coloring (Q6047973) (← links)