1215 search results - page 127 / 243 » Combinatorics |
127
Voted
COMBINATORICS
2002
15 years 3 months ago
2002
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 ...
110
Voted
COMBINATORICS
2002
15 years 3 months ago
2002
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...
110
Voted
COMBINATORICS
2002
15 years 3 months ago
2002
In 1906 Axel Thue showed how to construct an infinite non-repetitive (or squarefree) word on an alphabet of size 3. Since then this result has been rediscovered many times and ext...
110
Voted
COMBINATORICS
2002
15 years 3 months ago
2002
Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues...
134
Voted
COMBINATORICS
2002
15 years 3 months ago
2002
Knowing the excluded minors for a minor-closed matroid property provides a useful alternative characterization of that property. It has been shown in [R. Hall, J. Oxley, C. Semple...