#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2009

2017

- This year (1)
- Last 5 years (3)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Tsz Lung Chan, Wai Shun Cheung, Tuen Wai Ng
- Electr. J. Comb.
- 2009

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.

- Tsz Lung Chan
- Graphs and Combinatorics
- 2017

- Tsz Lung Chan
- Electr. J. Comb.
- 2015

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)

- Tsz Lung Chan
- Graphs and Combinatorics
- 2015

- ‹
- 1
- ›