#### Filter Results:

#### Publication Year

2011

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- JOHN MACHACEK
- 2011

The critical group K(G) of a graph G is a finite abelian group whose order is the number of spanning forests of the graph. Here we investigate the relationship between the critical group of a regular bipartite graph G and its line graph line G. The relationship between the two is known completely for regular nonbipartite graphs. We compute the critical… (More)

We consider the language consisting of all words such that it is possible to obtain the empty word by iteratively deleting powers. It turns out that in the case of deleting squares in binary words this language is regular, and in the case of deleting squares in words over a larger alphabet the language is not regular. However, for deleting squares over any… (More)

- ‹
- 1
- ›