Graceful Tree Conjecture for Infinite Trees
Tsz Lung Chan, Wai Shun Cheung, Tuen Wai Ng · The Electronic Journal of Combinatorics · 2009
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2009
Abstract
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.
Open the resolved locator · 10.37236/154
Metadata licence: OpenAlex metadata (CC0)