Sciweavers

Share
RSA
2008
123views more  RSA 2008»
9 years 3 months 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
SIAMDM
2000
59views more  SIAMDM 2000»
9 years 3 months ago
Nonhamiltonian 3-Connected Cubic Planar Graphs
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamil...
Robert E. L. Aldred, S. Bau, Derek A. Holton, Bren...
books