17 search results - page 1 / 4 » On the geometry of graphs with a forbidden minor |
101
click to vote
STOC
2009
ACM
16 years 8 days ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
83
Voted
COMBINATORICS
2006
14 years 11 months ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
ICALP
2000
Springer
15 years 3 months ago
2000
Springer
128
Voted
FAW
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several grap...