Modular gracious labellings of trees

DOI10.1016/S0012-365X(00)00318-6MaRDI QIDQ5937589zbMATH OpenFDO

Authors Michael John Grannell, T. S. Griggs, Fred C. Holroyd

Publication date 8 January 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(00)00318-6

zbMATH Keywords

gracious \(k\)-labelinggracious labeling

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• On Graceful Labelings of Trees
• A class of trees having strongly graceful labellings
• On modular and graceful labelings
• scientific article; zbMATH DE number 6863837
• On bipartite graceful labelings of trees
• A proof of the modular edge-graceful trees conjecture
• Counting graceful labelings of trees: a theoretical and empirical study
• Bipartite labelings of trees and the gracesize
• Constructing trees with graceful labelings using caterpillars
• Gracefully labeled trees from Skolem sequences

Cited in

(10)

• Gracefully labeled trees from Skolem sequences
• About the conjecture of felicitous trees
• A proof of the modular edge-graceful trees conjecture
• k-long graphs
• On Graceful Labelings of Trees
• A survey on the existence ofG-Designs
• scientific article; zbMATH DE number 1195746 (Why is no real title available?)
• scientific article; zbMATH DE number 6863837 (Why is no real title available?)
• Graceful pairings
• Bi-cyclic decompositions of complete graphs into spanning trees

This page was built for publication: Modular gracious labellings of trees

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