The chromatic number of oriented graphs
From MaRDI portal
Recommendations
Cited in
(90)- On the oriented chromatic number of grids
- Acyclic and \(k\)-distance coloring of the grid
- An oriented coloring of planar graphs with girth at least five
- Homomorphisms of edge-colored graphs and Coxeter groups
- Antisymmetric flows and strong colourings of oriented graphs
- A bound for the game chromatic number of graphs
- On the maximum average degree and the oriented chromatic number of a graph
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs
- Antisymmetric flows and edge-connectivity
- On universal graphs for planar oriented graphs of a given girth
- Oriented chromatic number of Cartesian products and strong products of paths
- Oriented colourings of graphs with maximum degree three and four
- A study on oriented relative clique number
- Colored homomorphisms of colored mixed graphs
- On deeply critical oriented graphs
- Minimum feedback vertex set and acyclic coloring.
- Forbidden subgraph colorings and the oriented chromatic number
- Oriented trees in digraphs
- Oriented coloring on recursively defined digraphs
- On the oriented coloring of the disjoint union of graphs
- Trees contained in every orientation of a graph
- Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \)
- On relative clique number of triangle-free planar colored mixed graphs
- A note on the orientation covering number
- 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
- Oriented cliques and colorings of graphs with low maximum degree
- Lower bounds of the skew spectral radii and skew energy of oriented graphs
- The oriented chromatic number of Halin graphs
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- On homomorphisms of oriented graphs with respect to the push operation
- A note on orientation and chromatic number of graphs
- \(L(2,1)\)-labelings of some families of oriented planar graphs
- On the oriented chromatic number of graphs with given excess
- Convex circuit-free coloration of an oriented graph
- Coloring graphs in oriented coloring of cubic graphs
- A homomorphic polynomial for oriented graphs
- Oriented list colorings of graphs
- Homomorphisms and colourings of oriented graphs: an updated survey
- On oriented graphs with certain extension properties.
- Outerplanar and planar oriented cliques
- The simple chromatic number of oriented graphs
- Acyclic and oriented chromatic numbers of graphs
- On oriented relative clique number
- scientific article; zbMATH DE number 3891394 (Why is no real title available?)
- Oriented vertex and arc colorings of partial 2-trees
- Strong oriented chromatic number of planar graphs without cycles of specific lengths
- On the oriented chromatic number of dense graphs
- Forbidden subgraph colorings and the oriented chromatic number
- On unavoidable digraphs in orientations of graphs
- Complete oriented colourings and the oriented achromatic number
- Oriented chromatic number of grids is greater than 7
- scientific article; zbMATH DE number 1341913 (Why is no real title available?)
- Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
- Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
- Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
- Homomorphisms of 2-edge-colored graphs
- Homomorphisms of 2-edge-colored graphs
- On the oriented game chromatic number
- Proper orientations and proper chromatic number
- Equitable oriented coloring
- On the oriented coloring of the disjoint union of graphs
- 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
- Acyclic vertex coloring of graphs of maximum degree 5
- The oriented chromatic number of the hexagonal grid is 6
- Oriented total-coloring of oriented graphs
- Oriented vertex and arc coloring of edge series-parallel digraphs
- On ( n , m )-chromatic numbers of graphs with bounded sparsity parameters
- On coloring parameters of triangle-free planar (n, m)-graphs
- Adding direction constraints to the 1-2-3 conjecture
- Colourings of (m, n)-coloured mixed graphs
- Oriented colouring graphs of bounded degree and degeneracy
- Injective edge colorings of degenerate graphs and the oriented chromatic number
- Computation of certain domination numbers of collaboration graphs
- Counting the minimum number of arcs in an oriented graph having weak diameter 2
- Switching m-edge-coloured graphs using non-abelian groups
- Homomorphisms of (n,m)-graphs with respect to generalised switch
- Colourings of oriented connected cubic graphs
- A note on the oriented chromatic number of grids
- On the oriented chromatic number of Halin graphs
- The 2-dipath chromatic number of Halin graphs
- Oriented vertex and arc colorings of outerplanar graphs
- Oriented colorings of 2-outerplanar graphs
- Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs
- On the chromatic number of an oriented matroid
- Oriented colorings of partial 2-trees
- On induced-universal graphs for the class of bounded-degree graphs
This page was built for publication: The chromatic number of oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344206)
