The edge density of critical digraphs
- 21 August 2014
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 35 (5) , 619-631
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Tournaments and colouringJournal of Combinatorial Theory, Series B, 2013
- Two results on the digraph chromatic numberDiscrete Mathematics, 2012
- Gallai's Theorem for List Coloring of DigraphsSIAM Journal on Discrete Mathematics, 2011
- A conjecture of Neumann-Lara on infinite families of -dichromatic circulant tournamentsDiscrete Mathematics, 2010
- On the edge-density of 4-critical graphsCombinatorica, 2009
- The circular chromatic number of a digraphJournal of Graph Theory, 2004
- Dense critical and vertex-critical graphsDiscrete Mathematics, 2002
- Ramsey-type theoremsDiscrete Applied Mathematics, 1989
- Chromatic number, girth and maximal degreeDiscrete Mathematics, 1978
- A Property of 4-Chromatic Graphs and some Remarks on Critical GraphsJournal of the London Mathematical Society, 1952