SIAMDM
2010
13 years 6 months ago
2010
Thomassen (J. Combin. Theory Ser. B, 62 (1994), pp. 180
SIAMDM
2008
13 years 11 months ago
2008
Alon, Krech, and Szab
EJC
2007
13 years 11 months ago
2007
It was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math. 27 (1985)], p. 466) that every longest circuit of a 3-connected graph must have a cho...
JCT
2006
13 years 11 months ago
2006
We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic me...
DM
2007
13 years 11 months ago
2007
In this note we continue the study of gaps in samples of geometric random variables originated in Hitczenko and Knopfmacher [Gap-free compositions and gap-free samples of geometri...
JCT
2006
13 years 11 months ago
2006
We prove that the anisotropic generating function of self-avoiding polygons is not a D-finite function--proving a conjecture of Guttmann [Discrete Math. 217 (2000) 167
DAM
2006
13 years 11 months ago
2006
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...