26 search results - page 3 / 6 » The Induced Subgraph Order on Unlabelled Graphs |
JAPLL
2006
13 years 5 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...
ARSCOM
2007
13 years 5 months ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
GG
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
SIAMDM
2008
13 years 5 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...
FAW
2007
Springer
13 years 11 months ago
2007
Springer
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...