The chromatic number of oriented graphs
From MaRDI portal
Publication:4344206
DOI<191::AID-JGT3>3.0.CO;2-G 10.1002/(SICI)1097-0118(199707)25:3<191::AID-JGT3>3.0.CO;2-GzbMath0874.05026OpenAlexW4231773516MaRDI QIDQ4344206
Publication date: 22 October 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199707)25:3<191::aid-jgt3>3.0.co;2-g
Related Items
Homomorphisms and colourings of oriented graphs: an updated survey ⋮ A note on the oriented chromatic number of grids ⋮ Oriented chromatic number of Cartesian products and strong products of paths ⋮ On the oriented chromatic number of Halin graphs ⋮ The 2-dipath chromatic number of Halin graphs ⋮ Oriented vertex and arc colorings of outerplanar graphs ⋮ Acyclic coloring of graphs of maximum degree five: nine colors are enough ⋮ On oriented relative clique number ⋮ Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \) ⋮ On homomorphisms of oriented graphs with respect to the push operation ⋮ On relative clique number of triangle-free planar colored mixed graphs ⋮ Coloring graphs in oriented coloring of cubic graphs ⋮ Equitable oriented coloring ⋮ Complete oriented colourings and the oriented achromatic number ⋮ Oriented list colorings of graphs ⋮ Oriented vertex and arc colorings of partial 2-trees ⋮ Strong oriented chromatic number of planar graphs without cycles of specific lengths ⋮ Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs ⋮ Oriented chromatic number of grids is greater than 7 ⋮ Acyclic vertex coloring of graphs of maximum degree 5 ⋮ Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\) ⋮ The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree ⋮ Classes of intersection digraphs with good algorithmic properties ⋮ On the oriented achromatic number of graphs ⋮ A homomorphic polynomial for oriented graphs ⋮ \(L(2,1)\)-labelings of some families of oriented planar graphs ⋮ Homomorphisms and oriented colorings of equivalence classes of oriented graphs ⋮ Antisymmetric flows and edge-connectivity ⋮ Oriented colourings of graphs with maximum degree three and four ⋮ Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs ⋮ Oriented coloring of triangle-free planar graphs and 2-outerplanar 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 ⋮ Homomorphisms of 2-edge-colored graphs ⋮ Homomorphisms of 2-edge-colored graphs ⋮ A study on oriented relative clique number ⋮ Oriented coloring on recursively defined digraphs ⋮ Oriented colorings of partial 2-trees ⋮ On induced-universal graphs for the class of bounded-degree graphs ⋮ On the oriented chromatic number of graphs with given excess ⋮ On the oriented chromatic number of grids ⋮ Convex circuit-free coloration of an oriented graph ⋮ Outerplanar and Planar Oriented Cliques ⋮ Acyclic and \(k\)-distance coloring of the grid ⋮ Oriented cliques and colorings of graphs with low maximum degree ⋮ Homomorphisms of edge-colored graphs and Coxeter groups ⋮ An oriented coloring of planar graphs with girth at least five ⋮ Antisymmetric flows and strong colourings of oriented graphs ⋮ Colourings of oriented connected cubic graphs ⋮ A bound for the game chromatic number of graphs ⋮ On universal graphs for planar oriented graphs of a given girth ⋮ Colored homomorphisms of colored mixed graphs ⋮ On deeply critical oriented graphs ⋮ Minimum feedback vertex set and acyclic coloring. ⋮ Lower bounds of the skew spectral radii and skew energy of oriented graphs ⋮ The oriented chromatic number of Halin graphs ⋮ On the oriented coloring of the disjoint union of graphs
