Oriented 5-coloring of sparse plane graphs
From MaRDI portal
Recommendations
- An oriented coloring of planar graphs with girth at least five
- scientific article; zbMATH DE number 4047151
- On star 5-colorings of sparse graphs
- Circular \((5,2)\)-coloring of sparse graphs
- On linear-time algorithms for five-coloring planar graphs
- Injective coloring of plane graphs with girth 5
- Optimal Parallel 5-Colouring of Planar Graphs
- Edge colorings of planar graphs with maximum degree five.
- Linear coloring of planar graphs with girth at least five
- Distinguishing colorings of 3-connected planar graphs with five colors
Cited in
(15)- An oriented coloring of planar graphs with girth at least five
- Good and semi-strong colorings of oriented planar graphs
- On fractional version of oriented coloring
- Circular \((5,2)\)-coloring of sparse graphs
- An oriented 7-colouring of planar graphs with girth at least 7
- An oriented 6-coloring of planar graphs with girth at least 9
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
- Homomorphism bounds for oriented planar graphs of given minimum girth
- Decomposition of sparse graphs into two forests, one having bounded maximum degree
- \((k,1)\)-coloring of sparse graphs
- On the existence and non-existence of improper homomorphisms of oriented and 2-edge-coloured graphs to reflexive targets
- Circular flows in planar graphs
- Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
- On colouring oriented graphs of large girth
- List 2-facial 5-colorability of plane graphs with girth at least 12
This page was built for publication: Oriented 5-coloring of sparse plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115582)
