Sciweavers

SIAMDM
2010
93views more  SIAMDM 2010»
12 years 11 months ago
Thomassen's Choosability Argument Revisited
Thomassen (J. Combin. Theory Ser. B, 62 (1994), pp. 180
David R. Wood, Svante Linusson
SIAMDM
2008
81views more  SIAMDM 2008»
13 years 4 months ago
Polychromatic Colorings of Subcubes of the Hypercube
Alon, Krech, and Szab
David Offner
EJC
2007
13 years 4 months ago
Chords of longest circuits in locally planar graphs
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...
Ken-ichi Kawarabayashi, Jianbing Niu, Cun-Quan Zha...
JCT
2006
53views more  JCT 2006»
13 years 4 months ago
On the number of factorizations of a full cycle
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...
John Irving
DM
2007
87views more  DM 2007»
13 years 4 months ago
Gaps in samples of geometric random variables
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...
William M. Y. Goh, Pawel Hitczenko
JCT
2006
46views more  JCT 2006»
13 years 4 months ago
Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
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
Andrew Rechnitzer
DAM
2006
100views more  DAM 2006»
13 years 4 months ago
On the colored Tutte polynomial of a graph of bounded treewidth
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...
Lorenzo Traldi