973 search results - page 7 / 195 » New Bounds on Crossing Numbers |
JGT
2007
13 years 7 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
For a given connected graph G on n vertices and m edges, we prove that its independence number α(G) is at least ((2m+n+2) -((2m+n+2)2 -16n2 )½ )/8. Keywords : independence numbe...
DMCCG
2001
Springer
13 years 12 months ago
2001
Springer
COMBINATORICS
2006
13 years 7 months ago
2006
COMBINATORICS
2007
13 years 7 months ago
2007
