Sciweavers

53
Voted
COMBINATORICS
2002
52views more  COMBINATORICS 2002»
14 years 11 months ago
A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property
Peter J. Cameron, Dudley Stark
76
Voted
COMBINATORICS
2002
69views more  COMBINATORICS 2002»
14 years 11 months ago
Homogeneous Permutations
Peter J. Cameron
54
Voted
COMBINATORICS
2002
75views more  COMBINATORICS 2002»
14 years 11 months ago
Cycle Index, Weight Enumerator, and Tutte Polynomial
Peter J. Cameron
47
Voted
COMBINATORICS
2002
73views more  COMBINATORICS 2002»
14 years 11 months ago
Relaxed Graceful Labellings of Trees
Frank Van Bussel
66
Voted
COMBINATORICS
2002
97views more  COMBINATORICS 2002»
14 years 11 months ago
Words Restricted by Patterns with at Most 2 Distinct Letters
Alexander Burstein, Toufik Mansour
58
Voted
COMBINATORICS
2002
59views more  COMBINATORICS 2002»
14 years 11 months ago
On Counting Permutations by Pairs of Congruence Classes of Major Index
Hélène Barcelo, Robert Maule, Sheila...
66
Voted
COMBINATORICS
2002
99views more  COMBINATORICS 2002»
14 years 11 months ago
Packing Patterns into Words
Alexander Burstein, Peter Hästö, Toufik ...
85
Voted
COMBINATORICS
2002
88views more  COMBINATORICS 2002»
14 years 11 months ago
MacWilliams Identities and Matroid Polynomials
We present generalisations of several MacWilliams type identities, including those by Kl
Thomas Britz
COMBINATORICS
2002
88views more  COMBINATORICS 2002»
14 years 11 months ago
Graph Color Extensions: When Hadwiger's Conjecture and Embeddings Help
Suppose G is r-colorable and P V (G) is such that the components of G[P] are far apart. We show that any (r + s)-coloring of G[P] in which each component is s-colored extends to ...
Michael O. Albertson, Joan P. Hutchinson