@article{KY2014,
    AUTHOR = {{Kostochka}, A. and {Yancey}, M.},
     TITLE = {Ore's Conjecture on color-critical graphs is almost true},
    journal = {Combin. Theory Ser. B},
   volume = {109},
  year = "2014",
  pages = {73--101},
}

@ARTICLE{KY2015,
   author = {{Kostochka}, A. and {Yancey}, M.},
    title = "{A Brooks-type result for sparse critical graphs}",
  journal = {arXiv:1408.0846},
archivePrefix = "arXiv",
   eprint = {1408.0846},
 primaryClass = "math.CO",
 keywords = {Mathematics - Combinatorics, 05C15, 05C35},
     year = 2014,
    month = aug,
   adsurl = {http://adsabs.harvard.edu/abs/2014arXiv1408.0846K},
  adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}

@ARTICLE{KR2014,
   author = {{Kierstead}, H. and {Rabern}, L.},
    title = "{Improved lower bounds on the number of edges in list critical and online list critical graphs}",
  journal = {arXiv:1406.7355 },
archivePrefix = "arXiv",
   eprint = {1406.7355},
 primaryClass = "math.CO",
 keywords = {Mathematics - Combinatorics},
     year = 2014,
    month = jun,
   adsurl = {http://adsabs.harvard.edu/abs/2014arXiv1406.7355K},
  adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}

@ARTICLE{CW2013,
   author = {{Cranston}, D. and {West}, D.},
    title = "{A Guide to the Discharging Method}",
  journal = {arXiv:1306.4434},
archivePrefix = "arXiv",
   eprint = {1306.4434},
 primaryClass = "math.CO",
 keywords = {Mathematics - Combinatorics, 05C15},
     year = 2013,
    month = jun,
   adsurl = {http://adsabs.harvard.edu/abs/2013arXiv1306.4434C},
  adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}

@article{H35,
    AUTHOR = {{Hall}, P.},
     TITLE = {On representatives of subsets},
    journal = {J. Lond. Mat. Sc.},
   volume = {10},
  year = "1935",
  pages = {26--30},
}

@article{D53,
    AUTHOR = {{Dirac}, G. A.},
     TITLE = {The structure of $k$-chromatic graphs},
    journal = {Fund. Math.},
   volume = {40},
  year = "1953",
  pages = {42--50},
}


@book{G88,
    AUTHOR = {{Gould}, R.},
     TITLE = {Graph {T}heory},
   publisher = {The Benjamin/Cummings Publishing Co., Inc., Menlo Park, CA},
  year = "1988",
}

@book{W2001,
 author = {{West}, D.},
 title = {Introduction to {G}raph {T}heory},
 publisher = {Prentice-Hall, Inc., Upper Saddle River, NJ},
 year = {2001},
 edition = {2nd},
}

@article{B41,
  author = {{Brooks}, R. L.},
  title = {On colouring the nodes of a network},
  journal = {Proc. Cambridge Phil. Soc.},
  volume = {37},
 year = "1941",
 pages = {194--197},
}

@article{BK77,
  author = {{Borodin}, O. V. and {Kostochka}, A.},
  title = {On an upper bound of the graph's chromatic number depending on the graph's degree and density},
  journal = {J. Comb. Th. (B)},
  volume = {23},
 year = "1977",
 pages = {247--250},
}

@article{R99,
  author = {{Reed}, B.},
  title = {A strengthening of {B}rooks' theorem},
  journal = {J. Comb. Th. (B)},
  volume = {76},
 year = "1999",
 pages = {136--149},
}

@article{AHK77,
 author = {{Appel}, K. and {Haken}, W. and {Koch}, J.},
 title = {Every planar map is four colorable. {P}art {II}: {R}educibility},
 journal = {Illinois J. Math.},
 volume = {21},
 year = {1977},
 pages = {491--567},
}

@article{RSST96,
 author = {{Robertson}, N. and {Sanders}, D. and {Seymour}, P. and {Thomas}, R.},
 title = {Efficiently four-coloring planar graphs},
 journal = {Proc. 28th ACM Symp. Theory of Comp.},
 year = {1996},
 pages = {571--575},
}

@article{G59,
 author = {{Gr{\"o}tzsch}, H.},
 title = {Ein {D}reifarbensatz f{\"u}r dreikreisfreie {N}etze auf der {K}ugel},
 journal = {Wiss. Z. Martin-Luther-U., Halle-Wittenberg, Math.-Nat. Reihe},
 volume = {8},
 year = {1959},
 pages = {109--120},
}


@book{O67,
 author = {{Ore}, O.},
 title = {The Four Color Problem},
 publisher = {Academic Press, New York},
 year = {1967},
}

@article{D57,
 author = {{Dirac}, G. A.},
 title = {A theorem of {R}. {L}. {B}rooks and a conjecture of {H}. {H}adwiger},
 journal = {Proc. London Math. Soc.},
 volume = {3},
 issue = {7},
 year = {1957},
 pages = {161--195},
}

@article{KS99,
 author = {{Kostochka}, A. and {Stiebitz}, M.},
 title = {Excess in colour-critical graphs},
 journal = {Bolyai Society, Mathematical Studies},
 volume = {7},
 year = {1999},
 pages = {87--99},
}
 
@article{G63,
 author = {{Gallai}, T.},
 title = {{K}ritische {G}raphen {II}},
 journal = {Publ. Math. Inst. Hungar. Acad. Sci.},
 volume = {8},
 year = {1963},
 pages = {373--395},
}

@article{K97,
 author = {{Krivelevich}, M.},
 title = {On the minimal number of edges in color-critical graphs},
 journal = {Combinatorica},
 volume = {17},
 year = {1997},
 pages = {401--426},
}

@unpublished{P2014,
author = "{Postle}, L.",
title = "4-critical graphs of girth at least five",
year = {2014},
note = "Unpublished manuscript",
}