202 search results - page 2 / 41 » Large-Girth Roots of Graphs |
99
Voted
JCT
2007
15 years 17 days ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
84
Voted
DM
2010
15 years 22 days ago
2010
The chromatic capacity of a graph G; CAP (G) ; is the largest integer k such that there is a k-colouring of the edges of G such that when the vertices of G are coloured with the s...
45
Voted
COMBINATORICA
2004
15 years 15 days ago
2004
55
Voted
JCT
2002
15 years 10 days ago
2002
111
Voted
CORR
2007
Springer
15 years 19 days ago
2007
Springer
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring...