<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xml:base="http://openproblemgarden.org" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel>
 <title>Open Problem Garden - Petersen coloring conjecture - Comments</title>
 <link>http://openproblemgarden.org/op/petersen_coloring_conjecture</link>
 <description>Comments for &quot;Petersen coloring conjecture&quot;</description>
 <language>en</language>
<item>
 <title>Re:  (re: Petersen coloring conjecture)</title>
 <link>http://openproblemgarden.org/op/petersen_coloring_conjecture#comment-7089</link>
 <description>&lt;p&gt;It is trivially true for all that are 3-edge-colorable -- which is the vast majority.  Among the rest, I checked it using computer and lists of snarks for all graphs upto 34 vertices. (And some more -- e.g. all flower-snarks.) &lt;/p&gt;
&lt;p&gt;Best wishes,   Robert&lt;/p&gt;
</description>
 <pubDate>Thu, 24 Nov 2011 17:19:38 +0100</pubDate>
 <dc:creator>Robert Samal</dc:creator>
 <guid isPermaLink="false">comment 7089 at http://openproblemgarden.org</guid>
</item>
<item>
 <title>Question  (re: Petersen coloring conjecture)</title>
 <link>http://openproblemgarden.org/op/petersen_coloring_conjecture#comment-7067</link>
 <description>&lt;p&gt;For which bridgeless cubic graphs has this been checked for?&lt;/p&gt;
</description>
 <pubDate>Mon, 07 Nov 2011 23:55:19 +0100</pubDate>
 <dc:creator>Anonymous</dc:creator>
 <guid isPermaLink="false">comment 7067 at http://openproblemgarden.org</guid>
</item>
<item>
 <title>Petersen coloring conjecture</title>
 <link>http://openproblemgarden.org/op/petersen_coloring_conjecture</link>
 <description>&lt;table cellspacing=&quot;10&quot;&gt;
&lt;tr&gt;
  &lt;td&gt;
    Author(s):
        &lt;a href=&quot;/category/jaeger&quot;&gt;Jaeger&lt;/a&gt;&amp;nbsp;&amp;nbsp;
  &lt;/td&gt;
  &lt;td align=right&gt;
    Subject:
        &lt;a href=&quot;/category/graph_theory&quot;&gt;Graph Theory&lt;/a&gt; » &lt;a href=&quot;/category/coloring&quot;&gt;Coloring&lt;/a&gt; » &lt;a href=&quot;/category/edge_coloring&quot;&gt;Edge coloring&lt;/a&gt;&amp;nbsp;&amp;nbsp;
  &lt;/td&gt;
&lt;/tr&gt;

&lt;tr&gt;
  &lt;td colspan=2&gt;
    &lt;table border=1 cellspacing=&quot;5&quot;&gt;
      &lt;tr&gt;&lt;td&gt;
        &lt;div class=&quot;envtheorem&quot;&gt;&lt;b&gt;Conjecture&lt;/b&gt;&amp;nbsp;&amp;nbsp; Let &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png&quot; alt=&quot;$ G $&quot; /&gt; be a &lt;a href=&quot;http://en.wikipedia.org/wiki/cubic graph&quot;&gt;cubic&lt;/a&gt; graph with no &lt;a href=&quot;http://en.wikipedia.org/wiki/bridge (graph theory)&quot;&gt;bridge&lt;/a&gt;. Then there is a coloring of the edges of &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png&quot; alt=&quot;$ G $&quot; /&gt; using the edges of the &lt;a href=&quot;http://en.wikipedia.org/wiki/petersen graph&quot;&gt;Petersen&lt;/a&gt; graph so that any three mutually adjacent edges of &lt;img class=&quot;teximage&quot; src=&quot;/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png&quot; alt=&quot;$ G $&quot; /&gt; map to three mutually adjancent edges in the Petersen graph. &lt;/div&gt;

      &lt;/tr&gt;&lt;/td&gt;
    &lt;/table&gt;
  &lt;/td&gt;
&lt;/tr&gt;
&lt;/table&gt;</description>
 <category domain="http://openproblemgarden.org/category/jaeger">Jaeger, Francois</category>
 <category domain="http://openproblemgarden.org/category/cubic">cubic</category>
 <category domain="http://openproblemgarden.org/category/edge_coloring_0">edge-coloring</category>
 <category domain="http://openproblemgarden.org/category/petersen">Petersen graph</category>
 <category domain="http://openproblemgarden.org/category/graph_theory">Graph Theory</category>
 <category domain="http://openproblemgarden.org/category/coloring">Coloring</category>
 <category domain="http://openproblemgarden.org/category/edge_coloring">Edge coloring</category>
 <comments>http://openproblemgarden.org/op/petersen_coloring_conjecture#comment</comments>
 <pubDate>Wed, 07 Mar 2007 13:55:25 +0100</pubDate>
 <dc:creator>mdevos</dc:creator>
 <guid isPermaLink="false">143 at http://openproblemgarden.org</guid>
</item>
</channel>
</rss>
