most recent 30 from http://mathoverflow.net 2013-05-22T06:33:06Z http://mathoverflow.net/feeds/user/18117 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/120965/non-separable-simple-connected-graphs/120969#120969 vb le 2013-02-06T12:33:12Z 2013-02-06T12:33:12Z

<p>If you look for special graph classes, similar statements are possible, e.g., if each vertex of a <em>self-complementary graph</em> has degree at least two then the graph has no cut-vertex. </p>

http://mathoverflow.net/questions/2093/interesting-families-of-sparse-graphs/119124#119124 vb le 2013-01-17T00:23:37Z 2013-01-17T00:23:37Z

<p>Let me recommend the book <strong>J. Nešetřil and P. Ossona de Mendez,</strong> <a href="http://link.springer.com/book/10.1007/978-3-642-27875-4//page/1" rel="nofollow">Sparsity: Graphs, Structures, and Algorithms</a>, Springer 2012. It is the first systematic study of sparse graphs and related topics.</p>