Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/62188
Title: Labellings of trees with maximum degree three – an improved bound
Contributor(s): Brankovic, Ljiljana  (author)orcid ; Rosa, Alex (author); Siran, Jozef (author)
Publication Date: 2005
Handle Link: https://hdl.handle.net/1959.11/62188
Publication Type: Journal Article
Source of Publication: JCMCC, v.55, p. 159-169
Publisher: Charles Babbage Research Centre
Place of Publication: Canada
ISSN: 0835-3026
Fields of Research (FoR) 2020: 490404 Combinatorics and discrete mathematics (excl. physical combinatorics)
Socio-Economic Objective (SEO) 2020: 220499 Information systems, technologies and services not elsewhere classified
Peer Reviewed: Yes
HERDC Category Description: C1 Refereed Article in a Scholarly Journal
Publisher/associated links: https://combinatorialpress.com/jcmcc/vol55/
Appears in Collections:Journal Article
School of Science and Technology

Show full item record
Google Media

Google ScholarTM

Check


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