Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees
From MaRDI portal
Publication:814305
DOI10.1016/j.camwa.2005.04.006zbMath1080.05082MaRDI QIDQ814305
Publication date: 6 February 2006
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2005.04.006
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Some graceful lobsters with all three types of branches incident on the vertices of the central path
Cites Work