Oriented total-coloring of oriented graphs
From MaRDI portal
Recommendations
Cites work
- Acyclic and oriented chromatic numbers of graphs
- Colourings of oriented connected cubic graphs
- Complete oriented colourings and the oriented achromatic number
- Good and semi-strong colorings of oriented planar graphs
- Homomorphism bounds for oriented planar graphs
- Homomorphisms and colourings of oriented graphs: an updated survey
- Homomorphisms from sparse graphs with large girth.
- On acyclic colorings of planar graphs
- On deeply critical oriented graphs
- On oriented graphs with certain extension properties.
- On the maximum average degree and the oriented chromatic number of a graph
- On the oriented chromatic index of oriented graphs
- On universal graphs for planar oriented graphs of a given girth
- Oriented list colorings of graphs
- Outerplanar and planar oriented cliques
- The chromatic number of oriented graphs
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
This page was built for publication: Oriented total-coloring of oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589144)