#### Filter Results:

#### Publication Year

2009

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

One of the most famous open problems in graph theory is the Graceful Tree Conjecture, which states that every finite tree has a graceful labeling. In this paper, we define graceful labelings for countably infinite graphs, and state and verify a Graceful Tree Conjecture for countably infinite trees.

In this paper, we prove that every contraction-critical 2-connected infinite graph has no vertex of finite degree and contains uncountably many ends. Then, by investigating the distribution of contractible edges in a 2-connected locally finite infinite graph G, we show that the closure of the subgraph induced by all the contractible edges in the Freudenthal… (More)

- ‹
- 1
- ›