Infinitely many equivalent versions of the graceful tree conjecture

DOI10.2298/AADM141009017WzbMath1464.05327OpenAlexW1966844685WikidataQ123226362 ScholiaQ123226362MaRDI QIDQ5278770

Cheng-Chang Yang, Tao-Ming Wang, Eddie Cheng, Lih-Hsing Hsu

Publication date: 19 July 2017

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/aadm141009017w

zbMATH Keywords

graceful tree conjecturestrongly gracefulgracefully similargracefully similar factorstrongly graceful tree conjecture

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Computer search for graceful labeling: a survey ⋮ Counting graceful labelings of trees: a theoretical and empirical study ⋮ Almost all trees are almost graceful

This page was built for publication: Infinitely many equivalent versions of the graceful tree conjecture