COMBINATORICS
2006
13 years 4 months ago
2006
We investigate the existence of edge-magic labellings of countably infinite graphs by abelian groups. We show for that for a large class of abelian groups, including the integers ...
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...
SAS
2000
Springer
13 years 8 months ago
2000
Springer
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
LATA
2010
Springer
13 years 8 months ago
2010
Springer
Erd