An oriented 6-coloring of planar graphs with girth at least 9

DOI10.1007/S00373-015-1612-8zbMath1338.05090OpenAlexW1022854067MaRDI QIDQ293643

Timothy H. Marshall

Publication date: 9 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1612-8

zbMATH Keywords

homomorphismoriented graphplanar graphhomomorphism boundoriented coloringPaley tournament

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Homomorphism bounds for oriented planar graphs of given minimum girth
• Oriented colorings of triangle-free planar graphs
• Oriented colorings of partial 2-trees
• An oriented coloring of planar graphs with girth at least five
• On acyclic colorings of planar graphs
• On the maximum average degree and the oriented chromatic number of a graph
• Good and semi-strong colorings of oriented planar graphs
• Colorings and girth of oriented planar graphs
• An oriented 7-colouring of planar graphs with girth at least 7
• Oriented 5-coloring of sparse plane graphs
• Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs

This page was built for publication: An oriented 6-coloring of planar graphs with girth at least 9