Homomorphism bounds for oriented planar graphs of given minimum girth

DOI10.1007/s00373-012-1202-yzbMath1272.05055MaRDI QIDQ367080

Timothy H. Marshall

Publication date: 26 September 2013

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

Full work available at URL: https://doi.org/10.1007/s00373-012-1202-y

zbMATH Keywords

digraph; homomorphism; homomorphism bound; Paley tournament

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C20: Directed graphs (digraphs), tournaments

Related Items

Homomorphisms and colourings of oriented graphs: an updated survey, An oriented 6-coloring of planar graphs with girth at least 9, On oriented relative clique number, Homomorphism bounds for oriented planar graphs of given minimum girth, A study on oriented relative clique number, Oriented coloring on recursively defined digraphs, On the oriented coloring of the disjoint union of graphs, Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs, Efficient computation of the oriented chromatic number of recursively defined digraphs

Cites Work

• Unnamed Item
• Homomorphism bounds for oriented planar graphs of given minimum girth
• Oriented colorings of triangle-free planar graphs
• Oriented vertex and arc colorings of outerplanar graphs
• Oriented colorings of partial 2-trees
• An oriented coloring of planar graphs with girth at least five
• On the maximum average degree and the oriented chromatic number of a graph
• Every planar graph is 5-choosable
• Good and semi-strong colorings of oriented planar graphs
• Colorings and girth of oriented planar graphs
• A short list color proof of Grötzsch's theorem
• An oriented 7-colouring of planar graphs with girth at least 7
• Oriented 5-coloring of sparse plane graphs
• Homomorphism bounds for oriented planar graphs
• Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs