The chromatic number of oriented graphs

DOI10.1002/(SICI)1097-0118(199707)25:3%3C191::AID-JGT3%3E3.0.CO;2-GMaRDI QIDQ4344206zbMATH OpenOpenAlexWikidataFDO

Authors Éric Sopena

Publication date 22 October 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199707)25:3%3C191::aid-jgt3%3E3.0.co;2-g

zbMATH Keywords

graph coloringgraph homomorphismouterplanar graph\(k\)-tree

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Acyclic and oriented chromatic numbers of graphs
• Oriented vertex and arc colorings of outerplanar graphs
• Oriented colorings of partial 2-trees
• Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
• On the oriented chromatic number of Halin graphs

Cited in

(80)

• On induced-universal graphs for the class of bounded-degree graphs
• The oriented chromatic number of the hexagonal grid is 6
• Complete oriented colourings and the oriented achromatic number
• Homomorphisms of 2-edge-colored graphs
• A note on the orientation covering number
• Equitable oriented coloring
• Coloring graphs in oriented coloring of cubic graphs
• A homomorphic polynomial for oriented graphs
• Antisymmetric flows and strong colourings of oriented graphs
• On homomorphisms of oriented graphs with respect to the push operation
• On the oriented coloring of the disjoint union of graphs
• Proper orientations and proper chromatic number
• Homomorphisms and colourings of oriented graphs: an updated survey
• Convex circuit-free coloration of an oriented graph
• Oriented chromatic number of grids is greater than 7
• Efficient computation of the oriented chromatic number of recursively defined digraphs
• Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs
• Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\)
• Oriented chromatic number of Cartesian products and strong products of paths
• Colored homomorphisms of colored mixed graphs
• On the oriented coloring of the disjoint union of graphs
• On the chromatic number of an oriented matroid
• Oriented total-coloring of oriented graphs
• Oriented coloring on recursively defined digraphs
• A note on the oriented chromatic number of grids
• On the oriented chromatic number of Halin graphs
• Oriented vertex and arc colorings of outerplanar graphs
• Oriented colorings of 2-outerplanar graphs
• The 2-dipath chromatic number of Halin graphs
• Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
• Oriented list colorings of graphs
• On the oriented game chromatic number
• On the oriented chromatic number of grids
• Oriented colorings of partial 2-trees
• An oriented coloring of planar graphs with girth at least five
• The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree
• Strong oriented chromatic number of planar graphs without cycles of specific lengths
• Trees contained in every orientation of a graph
• Oriented vertex and arc coloring of edge series-parallel digraphs
• Lower bounds of the skew spectral radii and skew energy of oriented graphs
• A bound for the game chromatic number of graphs
• Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
• Homomorphisms and oriented colorings of equivalence classes of oriented graphs
• On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters
• On universal graphs for planar oriented graphs of a given girth
• On oriented relative clique number
• Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \)
• A note on orientation and chromatic number of graphs
• On the oriented chromatic number of dense graphs
• On deeply critical oriented graphs
• Acyclic coloring of graphs of maximum degree five: nine colors are enough
• Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs
• Forbidden subgraph colorings and the oriented chromatic number
• Acyclic vertex coloring of graphs of maximum degree 5
• Forbidden subgraph colorings and the oriented chromatic number
• On relative clique number of triangle-free planar colored mixed graphs
• Classes of intersection digraphs with good algorithmic properties
• On the oriented achromatic number of graphs
• Minimum feedback vertex set and acyclic coloring.
• On the oriented chromatic number of graphs with given excess
• On coloring parameters of triangle-free planar \((n, m)\)-graphs
• Homomorphisms of 2-edge-colored graphs
• The oriented chromatic number of Halin graphs
• On unavoidable digraphs in orientations of graphs
• \(L(2,1)\)-labelings of some families of oriented planar graphs
• Colourings of oriented connected cubic graphs
• Antisymmetric flows and edge-connectivity
• Adding direction constraints to the 1-2-3 conjecture
• On oriented graphs with certain extension properties.
• Outerplanar and planar oriented cliques
• The simple chromatic number of oriented graphs
• A study on oriented relative clique number
• Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
• Oriented vertex and arc colorings of partial 2-trees
• Oriented trees in digraphs
• Oriented colourings of graphs with maximum degree three and four
• scientific article; zbMATH DE number 3891394 (Why is no real title available?)
• 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

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)