<?xml version="1.0" encoding="UTF-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
  <title>e-sygoing.link — Graph Theory</title>
  <link>https://e-sygoing.link</link>
  <description>Latest links in the Graph Theory category</description>
  <language>en-us</language>
  <lastBuildDate>Sun, 24 May 2026 00:20:45 -0400</lastBuildDate>
  <atom:link href="https://e-sygoing.link/rss.php?type=new&amp;cid=61595"
             rel="self" type="application/rss+xml"/>
    <item>
    <title>Four Colour Theorem</title>
    <link>https://e-sygoing.link/link/5283697-four-colour-theorem</link>
    <description>A new proof of the four color theorem by Ashay Dharwadker that uses group theory and Steiner systems.</description>
    <pubDate>Thu, 06 Nov 2025 05:13:46 -0500</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283697</guid>
  </item>
    <item>
    <title>Hamiltonian Circuit Algorithm</title>
    <link>https://e-sygoing.link/link/5283709-hamiltonian-circuit-algorithm</link>
    <description>A new algorithm for finding Hamiltonian circuits with a constructive proof of Dirac&#039;s theorem and applications to finding Knight&#039;s Tours by Ashay Dharwadker.</description>
    <pubDate>Thu, 25 Sep 2025 17:42:43 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283709</guid>
  </item>
    <item>
    <title>Graphnet Archives</title>
    <link>https://e-sygoing.link/link/5283695-graphnet-archives</link>
    <description>Archives of the Graphnet mailing list from February 1990.</description>
    <pubDate>Sun, 06 Jul 2025 05:19:00 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283695</guid>
  </item>
    <item>
    <title>Parameters of Directed Strongly Regular Graphs</title>
    <link>https://e-sygoing.link/link/5283711-parameters-of-directed-strongly-regular-graphs</link>
    <description>Parameters, constructions and nonexistence information for directed strongly regular graphs.</description>
    <pubDate>Tue, 11 Mar 2025 08:51:17 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283711</guid>
  </item>
    <item>
    <title>Regular Graphs Page</title>
    <link>https://e-sygoing.link/link/5283688-regular-graphs-page</link>
    <description>Tables of simple connected k-regular graphs on n vertices and girth at least g.</description>
    <pubDate>Wed, 18 Dec 2024 23:58:37 -0500</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283688</guid>
  </item>
    <item>
    <title>Thrackles</title>
    <link>https://e-sygoing.link/link/5283707-thrackles</link>
    <description>Jon Perry&#039;s pages on the thrackle conjecture.</description>
    <pubDate>Fri, 23 Aug 2024 13:10:05 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283707</guid>
  </item>
    <item>
    <title>A Survey of Distance-Transitive Graphs</title>
    <link>https://e-sygoing.link/link/5283701-a-survey-of-distance-transitive-graphs</link>
    <description>By Arjeh M. Cohen.</description>
    <pubDate>Mon, 17 Jun 2024 05:50:00 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283701</guid>
  </item>
    <item>
    <title>Knight&#039;s Tour Problem</title>
    <link>https://e-sygoing.link/link/5283702-knights-tour-problem</link>
    <description>Solution for chess boards with upto 32 squares.</description>
    <pubDate>Fri, 31 May 2024 04:58:37 -0400</pubDate>
    <guid isPermaLink="false">https://e-sygoing.link/go/5283702</guid>
  </item>
  </channel>
</rss>
