On deeply critical oriented graphs

DOI10.1006/JCTB.2000.1984MaRDI QIDQ1850516zbMATH OpenOpenAlexFDO

Authors Oleg V. Borodin, Dmitry G. Fon-Der-Flaass, Alexandr Kostochka, André Raspaud, Éric 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

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

Recommendations

• On deeply critical oriented cliques
• Complete oriented colourings and the oriented achromatic number
• Minimal orientations of colour critical graphs
• On the oriented chromatic number of Halin graphs
• Oriented graph coloring

Cites work

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

Cited in

(9)

• Complete oriented colourings and the oriented achromatic number
• Homomorphisms and colourings of oriented graphs: an updated survey
• Pushable chromatic number of graphs with maximum average degree at most \(\frac{14}{5}\)
• Oriented total-coloring of oriented graphs
• On the oriented chromatic number of grids
• Minimal orientations of colour critical graphs
• On deeply critical oriented cliques
• On the oriented chromatic number of graphs with given excess
• On coloring parameters of triangle-free planar \((n, m)\)-graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850516)