540 search results - page 1 / 108 » New bounds on the edge number of a k-map graph |
79
Voted
JGT
2007
14 years 10 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 ...
95
Voted
CORR
2007
Springer
14 years 10 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...
73
Voted
IPL
2002
14 years 10 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
COMBINATORICS
1998
14 years 10 months ago
1998
DM
1999
14 years 10 months ago
1999