3 search results - page 1 / 1 » On the Number of 3-Edge Colorings of Cubic Graphs |
EJC
2002
13 years 6 months ago
2002
GC
2010
Springer
13 years 4 months ago
2010
Springer
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex...
RSA
2008
13 years 5 months ago
2008
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, ...