The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges
From MaRDI portal
Publication:2255804
DOI10.1016/j.ejc.2014.12.002zbMath1307.05071OpenAlexW2010343794MaRDI QIDQ2255804
Benjamin Reiniger, Alexandr V. Kostochka
Publication date: 18 February 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2014.12.002
Related Items (3)
Critical graphs for the chromatic edge-stability number ⋮ Unnamed Item ⋮ Tools for counting odd cycles in graphs
Cites Work
This page was built for publication: The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges