A generating algorithm for all graceful labelings of graceful graphs

MaRDI QIDQ3110412zbMATH OpenFDO

Authors Baoxiang Tang, Han Ren

Publication date 27 January 2012

zbMATH Keywords

graceful graphgraceful labelinggraceful permutation

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Graceful labelings -- properties and algorithms
• Graceful labeling algorithms and complexity -- a survey
• Generation of graceful trees from arbitrary trees
• scientific article; zbMATH DE number 1990683
• An algorithm for graceful labelings of cycles

Cited in

(9)

• Applications of mathematical programming in graceful labeling of graphs
• Graceful labelings -- properties and algorithms
• scientific article; zbMATH DE number 4174981 (Why is no real title available?)
• scientific article; zbMATH DE number 5309984 (Why is no real title available?)
• scientific article; zbMATH DE number 1990683 (Why is no real title available?)
• Graceful labelings of the generalized Petersen graphs
• scientific article; zbMATH DE number 6940825 (Why is no real title available?)
• scientific article; zbMATH DE number 6459026 (Why is no real title available?)
• An algorithm for graceful labelings of cycles

This page was built for publication: A generating algorithm for all graceful labelings of graceful graphs

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