@article{8014a55dc4584bd5b6a49172f707b0c9,
title = "On Deeply Critical Oriented Graphs",
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.",
author = "Borodin, {O. V.} and D. Fon-Der-Flaass and Kostochka, {A. V.} and A. Raspaud and E. Sopena",
note = "Funding Information: 1This work was partially supported by Grant 97-01-01075 of the Russian Foundation for Fundamental Research and by Grant Intas-Open-97-1001. 2This research was partly supported by NATO Collaborative Research Grant 97-1519. 3This work was partially supported by Grant 99-01-00581 of the Russian Foundation for Fundamental Research and 1792 of the Universities of Russia Fundamental Research Program.",
year = "2001",
month = jan,
doi = "10.1006/jctb.2000.1984",
language = "English (US)",
volume = "81",
pages = "150--155",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "1",
}