1729 search results - page 18 / 346 » On Bounds for the k-Partitioning of Graphs |
JGT
2006
14 years 9 months ago
2006
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
GD
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
ISSAC
2007
Springer
15 years 3 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
101
click to vote
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
STOC
2004
ACM
15 years 10 months ago
2004
ACM
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree: