Characterizing 4-critical graphs with Ore-degree at most seven

Luke Postle. Characterizing 4-critical graphs with Ore-degree at most seven. Journal of Combinatorial Theory, Series A, 129:107-147, 2018. [doi]

@article{Postle18,
  title = {Characterizing 4-critical graphs with Ore-degree at most seven},
  author = {Luke Postle},
  year = {2018},
  doi = {10.1016/j.jctb.2017.09.010},
  url = {https://doi.org/10.1016/j.jctb.2017.09.010},
  researchr = {https://researchr.org/publication/Postle18},
  cites = {0},
  citedby = {0},
  journal = {Journal of Combinatorial Theory, Series A},
  volume = {129},
  pages = {107-147},
}