Graceful labeling algorithms and complexity -- a survey
From MaRDI portal
Publication:5403271
Recommendations
Cited in
(12)- A generating algorithm for all graceful labelings of graceful graphs
- Constraint models for graceful graphs
- scientific article; zbMATH DE number 6712797 (Why is no real title available?)
- It is all labeling
- Graceful labelling: state of the art, applications and future directions
- Computer search for graceful labeling: a survey
- Counting graceful labelings of trees: a theoretical and empirical study
- The computational complexity of cordial and equitable labelling
- Generation of graceful trees from arbitrary trees
- scientific article; zbMATH DE number 1990683 (Why is no real title available?)
- Applications of mathematical programming in graceful labeling of graphs
- Recent developments on gracefulness of graphs. A survey complemented with chessboard representations
This page was built for publication: Graceful labeling algorithms and complexity -- a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403271)