Colorings and girth of oriented planar graphs
From MaRDI portal
Recommendations
- An oriented coloring of planar graphs with girth at least five
- Homomorphism bounds for oriented planar graphs of given minimum girth
- An oriented colouring of planar graphs with girth at least 4
- Oriented vertex and arc colorings of outerplanar graphs
- An oriented 7-colouring of planar graphs with girth at least 7
Cites work
- scientific article; zbMATH DE number 3639666 (Why is no real title available?)
- scientific article; zbMATH DE number 878894 (Why is no real title available?)
- scientific article; zbMATH DE number 932194 (Why is no real title available?)
- Acyclic and oriented chromatic numbers of graphs
- Acyclic colorings of planar graphs
- Colorings and interpretations: a connection between graphs and grammar forms
- Duality and Polynomial Testing of Tree Homomorphisms
- Every planar map is four colorable
- Good and semi-strong colorings of oriented planar graphs
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- On acyclic colorings of planar graphs
- On the complexity of H-coloring
- On the oriented game chromatic number
- Some new good characterizations for directed graphs
- The effect of two cycles on the complexity of colourings by directed graphs
- Universality of \(A\)-mote graphs
Cited in
(51)- Oriented and injective oriented colourings of grid graphs
- An oriented 7-colouring of planar graphs with girth at least 7
- An oriented colouring of planar graphs with girth at least 4
- Complexity dichotomy for oriented homomorphism of planar graphs with large girth
- Strong chromatic index of planar graphs with large girth
- On fractional version of oriented coloring
- Odd graph and its applications to the strong edge coloring
- On the oriented chromatic number of grids
- Girth and fractional chromatic number of planar graphs
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
- Homomorphisms and colourings of oriented graphs: an updated survey
- Some of my favorite coloring problems for graphs and digraphs
- Additive bases and flows in graphs
- Circular flows in planar graphs
- Antisymmetric flows and strong colourings of oriented graphs
- An oriented coloring of planar graphs with girth at least five
- Oriented colorings of partial 2-trees
- Additive bases and flows in graphs
- On the oriented chromatic number of Halin graphs
- Oriented vertex and arc colorings of outerplanar graphs
- Circular coloring of planar digraphs
- On \(r\)-acyclic edge colorings of planar graphs
- Colored homomorphisms of colored mixed graphs
- On colouring oriented graphs of large girth
- A note on circular chromatic number of graphs with large girth and similar problems
- Nilpotent families of endomorphisms of \((\mathcal P(V)^+,\cup)\)
- Partitions of graphs into cographs
- On the strong chromatic index of sparse graphs
- On the precise value of the strong chromatic index of a planar graph with a large girth
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
- On deeply critical oriented graphs
- On universal graphs for planar oriented graphs of a given girth
- Antisymmetric flows and strong oriented coloring of planar graphs
- Chromatic number of sparse colored mixed planar graphs
- Colorings and orientations of graphs
- Homomorphism bounds for oriented planar graphs
- The complexity of partitioning into disjoint cliques and a triangle-free graph
- The game coloring number of planar graphs with a given girth
- Oriented vertex and arc colorings of partial 2-trees
- Exact square coloring of subcubic planar graphs
- On a list variant of the multiplicative 1-2-3 conjecture
- An extension of Kotzig's theorem
- An oriented 6-coloring of planar graphs with girth at least 9
- \(L(2,1)\)-labeling of oriented planar graphs
- scientific article; zbMATH DE number 2230325 (Why is no real title available?)
- Homomorphism bounds for oriented planar graphs of given minimum girth
- On nice and injective-nice tournaments
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs
- Homomorphisms from sparse graphs with large girth.
- Homomorphisms of edge-colored graphs and Coxeter groups
This page was built for publication: Colorings and girth of oriented planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356774)
