347 search results - page 18 / 70 » Schaefer's theorem for graphs |
91
Voted
TAGT
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. We investigate and compare four variants of the doublepushout approach to graph transformation. Besides the traditional approach with arbitrary matching and injective rig...
DAM
2008
14 years 9 months ago
2008
For a graph G, let fij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the fij's can be expr...
JGT
2010
14 years 8 months ago
2010
. Dirac. Some theorems on abstract graphs. Proc. London Math. Soc. (3), 2:69–81, 1952. [2] Hikoe Enomoto and Katsuhiro Ota. Partitions of a graph into paths with prescribed endve...
89
Voted
EJC
2002
14 years 9 months ago
2002
A subgraph H of a graph G is gated if for every x V(G) there exists a vertex u in H such that dG (x, v) = dG (x, u) + d G (u, v) for any v V(H). The gated amalgam of graphs G 1 an...
ECEASST
2010
14 years 4 months ago
2010
Abstract. We present Local Church-Rosser, Parallelism, and Concurrency Theorems for rules with nested application conditions in the framework of weak adhesive HLR categories includ...