Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. Anick, D.: Counting graceful labelings of trees: a theoretical and empirical study. Discret. Appl. Math. 198, 65–81 (2016)
2. Broersma, A.J., Hoede, C.: Another equivalent of the graceful tree conjecture. Ars Combinatoria 51, 183–192 (1999)
3. Bussel, F.V.: 0-Centred and 0-ubiquitously graceful trees. Discret. Math. 277(1–3), 193–218 (2004)
4. Cattell, R.: Graceful labellings of paths. Discret. Math. 307(24), 3161–3176 (2007)
5. Chung, F.R.K., Hwang, F.K.: Rotatable graceful graphs. Ars Combinatoria 11, 239–250 (1981)