Minimal orientations of colour critical graphs (Q1894707): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Mikhail I. Ostrovskii / rank | |||
Property / reviewed by | |||
Property / reviewed by: Mikhail I. Ostrovskii / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On an upper bound of the graph's chromatic number, depending on the graph's degree and density / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hajos' graph-coloring conjecture: Variations and counterexamples / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4775887 / rank | |||
Normal rank |
Latest revision as of 15:53, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimal orientations of colour critical graphs |
scientific article |
Statements
Minimal orientations of colour critical graphs (English)
0 references
26 November 1995
0 references
An orientation of a graph \(G\) is called minimal if it possesses precisely one directed path of length \(\chi(G)- 1\). \textit{T. Gallai} [On directed paths and circuits, Theory of graphs, Proc. Colloquium Tihany, Hungary 1966, 115-118 (1968; Zbl 0159.544)] asked whether every colour critical graph has a minimal orientation. The author constructs a counterexample exhibiting a critically 4-chromatic graph on 14 vertices which has no minimal orientation. The author also proves that the answer is affirmative for \(k\)-critical graphs whose maximal degree is at most \(k\) when \(k\geq 5\).
0 references
chromatic number
0 references
orientation
0 references
path
0 references
colour critical graph
0 references
minimal orientation
0 references