202 search results - page 2 / 41 » Large-Girth Roots of Graphs |
JCT
2007
14 years 11 months 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 → ∞,...
DM
2010
14 years 11 months 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...
COMBINATORICA
2004
14 years 11 months ago
2004
JCT
2002
14 years 10 months ago
2002
CORR
2007
Springer
14 years 11 months 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...