Graceful labelling: state of the art, applications and future directions
From MaRDI portal
Publication:691624
DOI10.1007/s11786-011-0073-6zbMath1254.05169MaRDI QIDQ691624
Ian M. Wanless, Ljiljana Brankovic
Publication date: 3 December 2012
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-011-0073-6
Latin squares; graph decomposition; spectral graph theory; graceful tree conjecture; Oberwolfach problem; graph labellings; graceful labelling; map colouring; near transversal
05C05: Trees
05B15: Orthogonal arrays, Latin squares, Room squares
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Unnamed Item, Computer search for graceful labeling: a survey, Embedding an arbitrary tree in a graceful tree, Products of graceful bipartite graphs, Balanced equi-\(n\)-squares
Cites Work
- 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
- New families of graceful banana trees
- Optimal linear labelings and eigenvalues of graphs
- The gracefulness of a class of lobster trees
- Operations of interlaced trees and graceful trees
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- 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 labelings of trees and the gracesize
- Transversals in Latin Squares
- All trees of diameter five are graceful
- 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