192 search results - page 11 / 39 » On Graph Isomorphism for Restricted Graph Classes |
121
click to vote
EJC
2008
15 years 1 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
115
click to vote
JCT
2008
15 years 1 months ago
2008
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
108
click to vote
IDA
2007
Springer
15 years 1 months ago
2007
Springer
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
109
click to vote
DLT
2008
15 years 3 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
110
click to vote
GC
2007
Springer
15 years 1 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...