Title of article
On Deeply Critical Oriented Graphs
Author/Authors
Borodin، نويسنده , , O.V. and Fon-Der-Flaass، نويسنده , , D. and Kostochka، نويسنده , , A.V. and Raspaud، نويسنده , , A. and Sopena، نويسنده , , E.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
6
From page
150
To page
155
Abstract
For every positive integer k, we present an oriented graph Gk such that deleting any vertex of Gk decreases its oriented chromatic number by at least k and deleting any arc decreases the oriented chromatic number of Gk by two.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2001
Journal title
Journal of Combinatorial Theory Series B
Record number
1526764
Link To Document