Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Labellings of Trees with Maximum Degree Three-An Improved Bound

Ljiljana Brankovic1, Alex Rosa2, Jozef Sirén3
1School of Electrical Engineering and Computer Science University of Newcastle, Callgahan, NSW 2308, Australia
2Department of Mathematics and Statistics McMaster University Hamilton, Ontario, Canada L85 4K1
3 Department of Mathematics University of Auckland, Auckland, New Zealand
  • Published: 30/11/2005

Abstract

We improve the lower bound for the \(\alpha\)-size of trees with maximum degree three.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Ljiljana Brankovic, Alex Rosa, Jozef Sirén. Labellings of Trees with Maximum Degree Three-An Improved Bound[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 055. 159-169. DOI: .