Sciweavers

Share
4 search results - page 1 / 1
» Counting Claw-Free Cubic Graphs
Sort
View
SIAMDM
2002
124views more  SIAMDM 2002»
10 years 1 months ago
Counting Claw-Free Cubic Graphs
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...
DM
2007
113views more  DM 2007»
10 years 1 months ago
Counting labeled general cubic graphs
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...
RSA
2008
123views more  RSA 2008»
10 years 29 days ago
Generating unlabeled connected cubic planar graphs uniformly at random
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, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
DM
2008
177views more  DM 2008»
10 years 1 months ago
The independence number in graphs of maximum degree three
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...
books