<?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 - 4-regular 4-chromatic graphs of high girth - Comments</title>
 <link>http://openproblemgarden.org/op/high_girth_low_degree_4_chromatic_graphs</link>
 <description>Comments for &quot;4-regular 4-chromatic graphs of high girth&quot;</description>
 <language>en</language>
<item>
 <title>The list of known graphs is not full  (re: 4-regular 4-chromatic graphs of high girth)</title>
 <link>http://openproblemgarden.org/op/high_girth_low_degree_4_chromatic_graphs#comment-7134</link>
 <description>&lt;p&gt;Your list of 4 regular 4 chromatic graphs with girth &gt;= 4 is not complete. Check &quot;A note on 4-regular 4 chromatic graphs with girth 4&quot; http://math.nju.edu.cn/~zkmfl/kmzhang/41-60/Zhang44.pdf. Girth 5 is known too.&lt;/p&gt;
</description>
 <pubDate>Sun, 29 Jan 2012 15:14:35 +0100</pubDate>
 <dc:creator>Anonymous</dc:creator>
 <guid isPermaLink="false">comment 7134 at http://openproblemgarden.org</guid>
</item>
<item>
 <title>What about higher degree?  (re: 4-regular 4-chromatic graphs of high girth)</title>
 <link>http://openproblemgarden.org/op/high_girth_low_degree_4_chromatic_graphs#comment-3265</link>
 <description>&lt;p&gt;What maximum degree is needed in a triangle-free graph (or higher girth) with chromatic number 5?  What about chromatic number 6 and 7?  Are good bounds known on these maximum degrees?&lt;/p&gt;
</description>
 <pubDate>Thu, 13 Nov 2008 13:27:03 +0100</pubDate>
 <dc:creator>Anonymous</dc:creator>
 <guid isPermaLink="false">comment 3265 at http://openproblemgarden.org</guid>
</item>
<item>
 <title>4-regular 4-chromatic graphs of high girth</title>
 <link>http://openproblemgarden.org/op/high_girth_low_degree_4_chromatic_graphs</link>
 <description>&lt;table cellspacing=&quot;10&quot;&gt;
&lt;tr&gt;
  &lt;td&gt;
    Author(s):
        &lt;a href=&quot;/category/grunbaum&quot;&gt;Grunbaum&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;&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;Problem&lt;/b&gt;&amp;nbsp;&amp;nbsp; Do there exist 4-regular 4-chromatic graphs of arbitrarily high girth? &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/grunbaum">Grunbaum, Branko</category>
 <category domain="http://openproblemgarden.org/category/coloring_0">coloring</category>
 <category domain="http://openproblemgarden.org/category/girth">girth</category>
 <category domain="http://openproblemgarden.org/category/graph_theory">Graph Theory</category>
 <category domain="http://openproblemgarden.org/category/coloring">Coloring</category>
 <comments>http://openproblemgarden.org/op/high_girth_low_degree_4_chromatic_graphs#comment</comments>
 <pubDate>Wed, 18 Jun 2008 08:43:59 +0200</pubDate>
 <dc:creator>mdevos</dc:creator>
 <guid isPermaLink="false">830 at http://openproblemgarden.org</guid>
</item>
</channel>
</rss>
