2 search results - page 1 / 1 » On a family of cubic graphs containing the flower snarks |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider cubic graphs formed with k 2 disjoint claws Ci K1,3 (0 i k-1) such that for every integer i modulo k the three vertices of degree 1 of Ci are joined to the three v...
COMBINATORICS
1998
13 years 5 months ago
1998
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...