<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Isomorph-free generation of 2-connected graphs with applications · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1104.5261/</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/1104.5261/feed.xml" rel="self" type="application/rss+xml" /><item><title>Isomorph-free generation of 2-connected graphs with applications — mentioned by gilleain</title><link>https://news.ycombinator.com/item?id=17548829</link><guid isPermaLink="false">urn:hackerpapers:mention:1104.5261:17548829</guid><pubDate>Tue, 17 Jul 2018 11:17:59 GMT</pubDate><description>&lt;p&gt;Huh I wondered why his github had so much on git lately. I know his work from generating graphs (eg https://arxiv.org/abs/1104.5261)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1104.5261/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CO</category></item></channel></rss>
