JGT
2008
13 years 4 months ago
2008
Bonnington and Richter defined the cycle space of an infinite graph to consist of the sets of edges of subgraphs having even degree at every vertex. Diestel and K
DM
2010
13 years 4 months ago
2010
A graph G is loosely-c-connected, or -c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite co...
Book
A well-written book about graph theory.