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.
Cite
CITATION STYLE
APA
Chan, T. L., Cheung, W. S., & Ng, T. W. (2009). Graceful tree conjecture for infinite trees. Electronic Journal of Combinatorics, 16(1). https://doi.org/10.37236/154
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free