Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
Edgar M. Palmer, Ronald C. Read, Robert W. Robinso...
Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on metho...
Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinso...
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
Jochen Harant, Michael A. Henning, Dieter Rautenba...