3 search results - page 1 / 1 » New Spectral Lower Bounds on the Bisection Width of Graphs |
56
Voted
WG
2000
Springer
15 years 1 months ago
2000
Springer
JCT
2007
14 years 9 months ago
2007
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
88
Voted
WADS
2005
Springer
15 years 3 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...