On deeply critical oriented graphs

DOI10.1006/jctb.2000.1984zbMath1025.05024OpenAlexW2040293809MaRDI QIDQ1850516

Dmitry G. Fon-Der-Flaass, Oleg V. Borodin, Andre Raspaud, Alexandr V. Kostochka, Eric Sopena

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.1984

zbMATH Keywords

colouringoriented chromatic number

Mathematics Subject Classification ID

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

Related Items (6)

Homomorphisms and colourings of oriented graphs: an updated survey ⋮ On deeply critical oriented cliques ⋮ Complete oriented colourings and the oriented achromatic number ⋮ Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\) ⋮ On the oriented chromatic number of graphs with given excess ⋮ On the oriented chromatic number of grids

Cites Work

• On the maximum average degree and the oriented chromatic number of a graph
• Colorings and girth of oriented planar graphs
• On universal graphs for planar oriented graphs of a given girth
• Acyclic and oriented chromatic numbers of graphs
• The chromatic number of oriented graphs

This page was built for publication: On deeply critical oriented graphs