547 search results - page 60 / 110 » dm 2008 |
106
Voted
DM
2007
15 years 24 days ago
2007
—We give an inequality for the group chromatic number of a graph as an extension of Brooks’ Theorem. Moreover, we obtain a structural theorem for graphs satisfying the equality...
87
Voted
DM
2002
15 years 19 days ago
2002
A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. This pap...
DM
2002
15 years 19 days ago
2002
For each prime p, we construct an infinite antichain of matroids in which each matroid has characteristic set {p}. For p = 2, each of the matroids in our antichain is an excluded m...
123
Voted
DM
1998
15 years 15 days ago
1998
Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: For any...
81
Voted
DM
1999
15 years 15 days ago
1999
Every partition has, for some d, a Durfee square of side d. Every partition with Durfee square of side d gives rise to a "successive rank vector" r = (r1,