Bipartite labeling of trees with maximum degree three

C. Paul Bonnington, Jozef Sirán. Bipartite labeling of trees with maximum degree three. Journal of Graph Theory, 31(1):7-15, 1999. [doi]

@article{BonningtonS99,
  title = {Bipartite labeling of trees with maximum degree three},
  author = {C. Paul Bonnington and Jozef Sirán},
  year = {1999},
  doi = {10.1002/(SICI)1097-0118(199905)31:1<7::AID-JGT2>3.0.CO;2-Y},
  url = {http://dx.doi.org/10.1002/(SICI)1097-0118(199905)31:1<7::AID-JGT2>3.0.CO;2-Y},
  researchr = {https://researchr.org/publication/BonningtonS99},
  cites = {0},
  citedby = {0},
  journal = {Journal of Graph Theory},
  volume = {31},
  number = {1},
  pages = {7-15},
}