Graceful Tree Conjecture for Infinite Trees

  • Tsz Lung Chan
  • Wai Shun Cheung
  • Tuen Wai Ng
DOI: https://doi.org/10.37236/154

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.

Published
2009-05-29
How to Cite
Chan, T. L., Cheung, W. S., & Ng, T. W. (2009). Graceful Tree Conjecture for Infinite Trees. The Electronic Journal of Combinatorics, 16(1), R65. https://doi.org/10.37236/154
Issue
Volume 16, Issue 1 (2009)
Article Number
R65