109 search results - page 6 / 22 » dm 2007 |
FASE
2007
Springer
15 years 4 months ago
2007
Springer
52
Voted
FMSD
2007
14 years 10 months ago
2007
87
Voted
DM
2007
14 years 10 months ago
2007
We prove that the acyclic chromatic index a (G) 6 for all graphs with girth at least 9. We extend the same method to obtain a bound of 4.52 with the girth requirement g 220. We al...
84
Voted
DM
2007
14 years 10 months ago
2007
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...
78
Voted
DM
2007
14 years 10 months ago
2007
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...