Acyclic and oriented chromatic numbers of graphs
From MaRDI portal
Publication:3129826
DOI<331::AID-JGT5>3.0.CO;2-P 10.1002/(SICI)1097-0118(199704)24:4<331::AID-JGT5>3.0.CO;2-PzbMath0873.05044OpenAlexW4231906363WikidataQ115927316 ScholiaQ115927316MaRDI QIDQ3129826
Xuding Zhu, Eric Sopena, Alexandr V. Kostochka
Publication date: 20 October 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199704)24:4<331::aid-jgt5>3.0.co;2-p
Related Items (49)
Homomorphisms and colourings of oriented graphs: an updated survey ⋮ A note on the oriented chromatic number of grids ⋮ Oriented incidence colourings of digraphs ⋮ Oriented chromatic number of Cartesian products and strong products of paths ⋮ Analysis of a heuristic for acyclic edge colouring ⋮ Colorings and girth of oriented planar graphs ⋮ Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \) ⋮ The acircuitic directed star arboricity of subcubic graphs is at most four ⋮ On the signed chromatic number of some classes of graphs ⋮ Coloring graphs in oriented coloring of cubic graphs ⋮ Acyclic coloring of graphs without bichromatic long path ⋮ Acyclic chromatic index of chordless graphs ⋮ The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial ⋮ Acyclic edge coloring of graphs with large girths ⋮ Strong oriented chromatic number of planar graphs without cycles of specific lengths ⋮ Oriented chromatic number of grids is greater than 7 ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\) ⋮ On the adaptable chromatic number of graphs ⋮ Upper bounds on the acyclic chromatic index of degenerate graphs ⋮ On Chromatic Number of Colored Mixed Graphs ⋮ Homomorphism complexes, reconfiguration, and homotopy for directed graphs ⋮ Antisymmetric flows and strong oriented coloring of planar graphs ⋮ Unnamed Item ⋮ Acyclic edge coloring of planar graphs with girth at least 5 ⋮ Pushable chromatic number of graphs with degree constraints ⋮ Oriented colourings of graphs with maximum degree three and four ⋮ Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs ⋮ Acyclic Edge Coloring of Triangle‐Free Planar Graphs ⋮ A study on oriented relative clique number ⋮ Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms ⋮ Improved bounds for acyclic chromatic index of planar graphs ⋮ On the oriented chromatic number of graphs with given excess ⋮ Acyclic edge coloring of subcubic graphs ⋮ Oriented cliques and colorings of graphs with low maximum degree ⋮ An oriented coloring of planar graphs with girth at least five ⋮ On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets ⋮ Acyclic edge coloring of graphs with maximum degree 4 ⋮ Acyclic edge coloring of 2-degenerate graphs ⋮ A Local Lemma for Focused Stochastic Algorithms ⋮ Antisymmetric flows and strong colourings of oriented 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 ⋮ The game coloring number of planar graphs ⋮ Uniquely colorable graphs with equal chromatic and game chromatic numbers ⋮ The oriented chromatic number of Halin graphs
This page was built for publication: Acyclic and oriented chromatic numbers of graphs
