<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Mathematical Proofs of Two Conjectures: The Four Color Problem and The Uniquely 4-colorable Planar Graph · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0911.1587/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/0911.1587/feed.xml" rel="self" type="application/rss+xml" /><item><title>Mathematical Proofs of Two Conjectures: The Four Color Problem and The Uniquely 4-colorable Planar Graph — HN submission</title><link>https://news.ycombinator.com/item?id=939047</link><guid isPermaLink="false">urn:hackerpapers:submission:0911.1587:939047</guid><pubDate>Thu, 12 Nov 2009 23:55:19 GMT</pubDate><description>&lt;p&gt;Four color problem finally proved without a computer?&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 2 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/0911.1587/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>math.GM</category></item></channel></rss>
