Improved bounds for relaxed graceful trees

DOI10.1007/s00373-017-1757-8zbMath1368.05126arXiv1402.0196OpenAlexW2963621738MaRDI QIDQ2014211

Elliot Krop, Christian Barrientos

Publication date: 10 August 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.0196

zbMATH Keywords

graceful labelinggraceful tree conjectureedge-relaxed graceful labelinggracesizepartial matchingsrange-relaxed graceful labeling

Mathematics Subject Classification ID

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

Related Items (4)

Relaxing the injectivity constraint on arithmetic and harmonious labelings ⋮ Investigating several fundamental properties of random lobster trees and random spider trees ⋮ On \(\alpha\)-labellings of lobsters and trees with a perfect matching ⋮ New attack on Kotzigs conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The subdivision graph of a graceful tree is a graceful tree
• A dynamic survey of graph labeling
• Bipartite labeling of trees with maximum degree three
• Bipartite labelings of trees and the gracesize
• Lobsters with an almost perfect matching are graceful
• Relaxed graceful labellings of trees

This page was built for publication: Improved bounds for relaxed graceful trees