288 search results - page 5 / 58 » Linearly bounded infinite graphs |
126
Voted
WG
2010
Springer
15 years 1 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
127
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
149
Voted
JAPLL
2006
15 years 3 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
106
Voted
EJC
2010
15 years 3 months ago
2010
111
Voted
SIAMDM
2008
15 years 3 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...