Bipartite labeling of trees with maximum degree three

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199905)31:1<7::AID-JGT2>3.0.CO;2-Y" /><7::AID-JGT2>3.0.CO;2-Y 10.1002/(SICI)1097-0118(199905)31:1<7::AID-JGT2>3.0.CO;2-YzbMath0918.05089OpenAlexW4232395634MaRDI QIDQ4242730

Jozef Širáň, C. Paul Bonnington

Publication date: 28 July 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199905)31:1<7::aid-jgt2>3.0.co;2-y

zbMATH Keywords

treevertex colouringgraceful labelling

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Computer search for graceful labeling: a survey ⋮ Improved bounds for relaxed graceful trees ⋮ On \(\alpha\)-labellings of lobsters and trees with a perfect matching

This page was built for publication: Bipartite labeling of trees with maximum degree three