Graceful Tree Conjecture for Infinite Trees
-
Published:2009-05-29
Issue:1
Volume:16
Page:
-
ISSN:1077-8926
-
Container-title:The Electronic Journal of Combinatorics
-
language:
-
Short-container-title:Electron. J. Combin.
Author:
Chan Tsz Lung,Cheung Wai Shun,Ng Tuen Wai
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.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Prime labelings of infinite graphs;Involve, a Journal of Mathematics;2019-04-16
2. Graceful labeling for mushroom trees;Aequationes mathematicae;2014-04-11