Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
From MaRDI portal
Publication:5891099
Recommendations
Cites work
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- An oriented 7-colouring of planar graphs with girth at least 7
- An oriented coloring of planar graphs with girth at least five
- An oriented colouring of planar graphs with girth at least 4
- Good and semi-strong colorings of oriented planar graphs
- On the maximum average degree and the oriented chromatic number of a graph
- Oriented colorings of 2-outerplanar graphs
- Oriented colorings of partial 2-trees
- Oriented graph coloring
- Oriented vertex and arc colorings of outerplanar graphs
- The chromatic number of oriented graphs
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
Cited in
(8)- Antisymmetric flows and strong oriented coloring of planar graphs
- Homomorphism bounds for oriented planar graphs of given minimum girth
- Proper orientation number of triangle-free bridgeless outerplanar graphs
- An oriented 6-coloring of planar graphs with girth at least 9
- Oriented colorings of 2-outerplanar graphs
- Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
- Oriented colorings of partial 2-trees
- An oriented colouring of planar graphs with girth at least 4
This page was built for publication: Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5891099)