Colorings and girth of oriented planar graphs
From MaRDI portal
Publication:1356774
DOI10.1016/S0012-365X(96)00198-7zbMath0873.05042WikidataQ126529477 ScholiaQ126529477MaRDI QIDQ1356774
Eric Sopena, Jaroslav Nešetřil, Andre Raspaud
Publication date: 26 October 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Homomorphisms and colourings of oriented graphs: an updated survey ⋮ An oriented 6-coloring of planar graphs with girth at least 9 ⋮ \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree ⋮ On a list variant of the multiplicative 1-2-3 conjecture ⋮ On the oriented chromatic number of Halin graphs ⋮ Oriented vertex and arc colorings of outerplanar graphs ⋮ A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems ⋮ An extension of Kotzig's theorem ⋮ On the strong chromatic index of sparse graphs ⋮ Exact square coloring of subcubic planar graphs ⋮ Homomorphism bounds for oriented planar graphs of given minimum girth ⋮ On the precise value of the strong chromatic index of a planar graph with a large girth ⋮ Partitions of graphs into cographs ⋮ On nice and injective-nice tournaments ⋮ Oriented vertex and arc colorings of partial 2-trees ⋮ Additive bases and flows in graphs ⋮ Optimal unavoidable sets of types of 3-paths for planar graphs of given girth ⋮ Additive Bases and Flows in Graphs ⋮ On \(r\)-acyclic edge colorings of planar graphs ⋮ Homomorphisms and oriented colorings of equivalence classes of oriented graphs ⋮ Homomorphisms from sparse graphs with large girth. ⋮ \(L(2,1)\)-labeling of oriented planar graphs ⋮ Strong chromatic index of planar graphs with large girth ⋮ The complexity of partitioning into disjoint cliques and a triangle-free graph ⋮ Oriented colorings of partial 2-trees ⋮ Odd graph and its applications to the strong edge coloring ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 ⋮ On the oriented chromatic number of grids ⋮ Circular Flows in Planar Graphs ⋮ Homomorphisms of edge-colored graphs and Coxeter groups ⋮ Unnamed Item ⋮ Antisymmetric flows and strong colourings of oriented graphs ⋮ On universal graphs for planar oriented graphs of a given girth ⋮ Chromatic number of sparse colored mixed planar graphs ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs ⋮ Colored homomorphisms of colored mixed graphs ⋮ On deeply critical oriented graphs ⋮ Nilpotent families of endomorphisms of \((\mathcal P(V)^+,\cup)\) ⋮ Complexity dichotomy for oriented homomorphism of planar graphs with large girth
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The effect of two cycles on the complexity of colourings by directed graphs
- On the complexity of H-coloring
- Colorings and interpretations: a connection between graphs and grammar forms
- Universality of \(A\)-mote graphs
- On acyclic colorings of planar graphs
- 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
- Acyclic and oriented chromatic numbers of graphs
- Some new good characterizations for directed graphs
- Every planar map is four colorable
- Duality and Polynomial Testing of Tree Homomorphisms
- Acyclic colorings of planar graphs
- On the oriented game chromatic number
