Towards the Graceful Tree Conjecture: A Survey

Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/63417

Title:	Towards the Graceful Tree Conjecture: A Survey
Contributor(s):	Alfalayleh, Mousa (author); Brankovic, Ljiljana (author) ; Giggins, Helen (author); Islam, Md Zahidul (author)
Publication Date:	2004-07
Handle Link:	https://hdl.handle.net/1959.11/63417
Abstract:	A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set {0, 1, 2,...,n} such that the induced edge labels are all distinct. An induced edge label is the absolute value of the difference between the two end-vertex labels. The Graceful Tree Conjecture states that all trees have a graceful labeling. In this survey we present known results towards proving the Graceful Tree Conjecture.
Publication Type:	Conference Publication
Conference Details:	AWOCA 2004: The Fifteenth Australasian Workshop on Combinatorial Algorithms, Ballina, Australia, 6th - 9th July, 2004
Source of Publication:	Proceedings of the Fifteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2004), p. 239-247
Publisher:	National ICT Australia
Place of Publication:	Australia
Fields of Research (FoR) 2020:	490404 Combinatorics and discrete mathematics (excl. physical combinatorics)
Socio-Economic Objective (SEO) 2020:	280115 Expanding knowledge in the information and computing sciences
Peer Reviewed:	Yes
HERDC Category Description:	E1 Refereed Scholarly Conference Publication
Appears in Collections:	Conference Publication School of Science and Technology

1 files

File	Size	Format

Show full item record

Check

Research UNE