scientific article; zbMATH DE number 1990683

MaRDI QIDQ4430846zbMATH OpenFDO

Authors Z. Nikoloski, Narsingh Deo, Francis Suraweera

Publication date 13 October 2003

zbMATH Keywords

backtracking algorithmcomputational complexitygeneration of combinatorial objectsRingle-Kotzig conjecturetriangular tableau

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Graceful labeling algorithms and complexity -- a survey
• Generation of graceful trees from arbitrary trees
• A generating algorithm for all graceful labelings of graceful graphs
• A survey of graceful trees
• Counting graceful labelings of trees: a theoretical and empirical study

Cited in

(10)

• New classes of graceful trees
• scientific article; zbMATH DE number 5896555 (Why is no real title available?)
• A new class of graceful rooted trees
• A generating algorithm for all graceful labelings of graceful graphs
• scientific article; zbMATH DE number 568846 (Why is no real title available?)
• scientific article; zbMATH DE number 1789795 (Why is no real title available?)
• Computer search for graceful labeling: a survey
• Graceful labeling algorithms and complexity -- a survey
• Graceful labelling: state of the art, applications and future directions
• Counting graceful labelings of trees: a theoretical and empirical study

This page was built for publication:

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