1. Research UNE
  2. UNE
  3. Conference Publication
Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/63417
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAlfalayleh, Mousaen
dc.contributor.authorBrankovic, Ljiljanaen
dc.contributor.authorGiggins, Helenen
dc.contributor.authorIslam, Md Zahidulen
local.source.editorEditor(s): Seok-Hee Hongen
dc.date.accessioned2024-10-10T22:59:13Z-
dc.date.available2024-10-10T22:59:13Z-
dc.date.issued2004-07-
dc.identifier.citationProceedings of the Fifteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2004), p. 239-247en
dc.identifier.isbn186487628Xen
dc.identifier.urihttps://hdl.handle.net/1959.11/63417-
dc.description.abstract<p>A graceful labelling of an undirected graph <i>G</i> with <i>n</i> edges is a one-to-one function from the set of vertices of G to the set {0, 1, 2,...,<i>n</i>} 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.</p>en
dc.languageenen
dc.publisherNational ICT Australiaen
dc.relation.ispartofProceedings of the Fifteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2004)en
dc.titleTowards the Graceful Tree Conjecture: A Surveyen
dc.typeConference Publicationen
dc.relation.conferenceAWOCA 2004: The Fifteenth Australasian Workshop on Combinatorial Algorithmsen
local.contributor.firstnameMousaen
local.contributor.firstnameLjiljanaen
local.contributor.firstnameHelenen
local.contributor.firstnameMd Zahidulen
local.profile.schoolSchool of Science and Technologyen
local.profile.emaillbrankov@une.edu.auen
local.output.categoryE1en
local.record.placeauen
local.record.institutionUniversity of New Englanden
local.date.conference6th - 9th July, 2004en
local.conference.placeBallina, Australiaen
local.publisher.placeAustraliaen
local.format.startpage239en
local.format.endpage247en
local.peerreviewedYesen
local.title.subtitleA Surveyen
local.contributor.lastnameAlfalaylehen
local.contributor.lastnameBrankovicen
local.contributor.lastnameGigginsen
local.contributor.lastnameIslamen
dc.identifier.staffune-id:lbrankoven
local.profile.orcid0000-0002-5056-4627en
local.profile.roleauthoren
local.profile.roleauthoren
local.profile.roleauthoren
local.profile.roleauthoren
local.identifier.unepublicationidune:1959.11/63417en
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
local.title.maintitleTowards the Graceful Tree Conjectureen
local.output.categorydescriptionE1 Refereed Scholarly Conference Publicationen
local.conference.detailsAWOCA 2004: The Fifteenth Australasian Workshop on Combinatorial Algorithms, Ballina, Australia, 6th - 9th July, 2004en
local.search.authorAlfalayleh, Mousaen
local.search.authorBrankovic, Ljiljanaen
local.search.authorGiggins, Helenen
local.search.authorIslam, Md Zahidulen
local.uneassociationNoen
local.atsiresearchNoen
local.conference.venueBallina Beach Resort, Australiaen
local.sensitive.culturalNoen
local.year.published2004en
local.fileurl.closedpublishedhttps://rune.une.edu.au/web/retrieve/143f89d2-091a-4b16-bb07-3358973eba39en
local.subject.for2020490404 Combinatorics and discrete mathematics (excl. physical combinatorics)en
local.subject.seo2020280115 Expanding knowledge in the information and computing sciencesen
local.date.start2004-07-06-
local.date.end2004-07-09-
local.profile.affiliationtypeExternal Affiliationen
local.profile.affiliationtypeExternal Affiliationen
local.profile.affiliationtypeExternal Affiliationen
local.profile.affiliationtypeExternal Affiliationen
Appears in Collections:Conference Publication
School of Science and Technology
Files in This Item:
1 files
File SizeFormat 
Show simple item record
Google Media

Google ScholarTM

Check


Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.