Talk:Discharging method (discrete mathematics)

Todo: add a list of other "significant" results proved by discharging. These could include: Borodin's proof that every planar graph with minimum degree 5 contains a triangle with degree sum at most 17 and Borodin's proof that every planar graph with maximum degree at least 12 has edge-list chromatic number equal to maximum degree. Ptrillian 06:50, 2 January 2007 (UTC)[reply]

Check if Wernicke actually used the method in his 1904 paper

From reading Wilson's book "Graphs, colourings and the four-colour theorem" (beginning of Section 11) and from a quick look at Wernicke's paper I think that what was done in that paper is precisely the proof in the way Wilson describes in Theorem 11.2. But my German is not good enough to be sure. If someone can confirm this, could you change the text to reference Heesch's work (I cannot find in Wilson's book which article(s) of Heesch did include this idea), it is mentioned at length in the introduction of the first paper of Appel and Haken. Davidsevilla | Talk 12:07, 3 December 2014 (UTC)[reply]