Computer search for graceful labeling: a survey
From MaRDI portal
Publication:5081235
DOI10.5614/ejgta.2022.10.1.23zbMath1487.05228OpenAlexW4225254024MaRDI QIDQ5081235
Michael J. Reynolds, Ljiljana Brankovic
Publication date: 14 June 2022
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2022.10.1.23
Related Items (1)
Cites Work
- Gracefulness of families of spiders
- Graceful labelling: state of the art, applications and future directions
- Generalized complete mappings, neofields, sequenceable groups and block designs. I
- The number of transversals in a Latin square
- On the number of transversals in Cayley tables of cyclic groups
- Generalized complete mappings, neofields, sequenceable groups and block designs. II
- The gracefulness of a class of lobster trees
- Operations of interlaced trees and graceful trees
- A note on the number of graceful labellings of paths
- Triangular embeddings of complete graphs from graceful labellings of paths
- Applications of mathematical programming in graceful labeling of graphs
- Numbered complete graphs, unusual rulers, and assorted applications
- Bipartite labeling of trees with maximum degree three
- Bipartite labelings of trees and the gracesize
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Infinitely many equivalent versions of the graceful tree conjecture
- Transversals in Latin Squares
- Relaxed graceful labellings of trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computer search for graceful labeling: a survey
