Labellings of trees with maximum degree three -- an improved bound

MaRDI QIDQ5488287zbMATH OpenFDO

Authors Ljiljana Brankovic, Jozef Širáň, Alexander Rosa

Publication date 14 September 2006

zbMATH Keywords

graceful tree conjecture

Mathematics Subject Classification ID

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

Recommendations

• Bipartite labeling of trees with maximum degree three
• scientific article; zbMATH DE number 4214060
• On \(\alpha\)-labellings of lobsters and trees with a perfect matching
• Bipartite labelings of trees and the gracesize
• On bipartite graceful labelings of trees

Cited in

(9)

• Maximum gap labelings of graphs
• Improved bounds for relaxed graceful trees
• On \(\alpha\)-labellings of lobsters and trees with a perfect matching
• A characterization of L(2, 1)-labeling number for trees with maximum degree 3
• A Nice Labelling for Tree-Like Event Structures of Degree 3
• Bipartite labeling of trees with maximum degree three
• Bipartite labelings of trees and the gracesize
• Computer search for graceful labeling: a survey
• Graceful labelling: state of the art, applications and future directions

This page was built for publication: Labellings of trees with maximum degree three -- an improved bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488287)