Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
From MaRDI portal
Publication:5891099
DOI10.1016/J.ENDM.2011.05.022zbMATH Open1268.05081OpenAlexW2175801803MaRDI QIDQ5891099FDOQ5891099
Pascal Ochem, Alexandre Pinlou
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00530543/file/op10.pdf
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- On the maximum average degree and the oriented chromatic number of a graph
- An oriented coloring of planar graphs with girth at least five
- Good and semi-strong colorings of oriented planar graphs
- An oriented 7-colouring of planar graphs with girth at least 7
- An oriented colouring of planar graphs with girth at least 4
- The chromatic number of oriented graphs
- Oriented graph coloring
- Oriented vertex and arc colorings of outerplanar graphs
- Oriented colorings of 2-outerplanar graphs
- Oriented colorings of partial 2-trees
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
Cited In (5)
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)
