… if we insist the girth of G is … orientation of any large girth planar graph is Scolorable and
classify those digraphs on 3, 4 and 5 vertices which color all large girth oriented planar graphs…

… that every planar graph with girth at least 5 has an oriented … that every planar graph with
girth at least 5 has an oriented … of the oriented chromatic number of planar graphs is then the …

… We study colorings of squares of planar graphs with no short cycles. The square G 2 of a
graph G is the graph with the same vertex set in which two vertices are joined by an edge if their …

… chromatic number has already been investigated for various graph classes [7]. In this note,
we focus on planar graphs and we use the notation Pk for the class of planar graphs of girth …

… an oriented coloring is a homomorphism from an oriented graph … We discuss the special case
of circular coloring of graphs that is … Some coloring results on planar graphs with large girth …

… Section 3 deals with oriented colorings of planar graphs while Section 4 considers the …
planar graph with girth at least 16 has a homomorphism to the oriented planar circulant graph G(6…

… conditions for Δ and the girth. In this paper, we prove that if the girth of a planar graph G is
large enough … Gluing these two edge-colorings we construct a strong σ -edge-coloring of G . …

… (ϵ, G) to be the oriented planar graph comprising G, together with … We define the oriented
planar graph C(k, G) similarly, by … Colorings and girth of oriented planar graphs. Discret. Math. …

… of graph colouring. We can similarly define the oriented chromatic number o(H) of an oriented
graph … In this paper we study universal graphs for oriented planar graphs of given girth. By …

… conjecture by Pavol Hell about circular coloring is solved in … -girth of a planar graph G is at
least f(ϵ), then G is (2 + ϵ)-colorable. Note that the function f(ϵ) is independent of the graph G …