Trees having an even or quasi even degree sequence are graceful

DOI10.1016/j.aml.2006.04.020zbMath1204.05086OpenAlexW2075951676MaRDI QIDQ1001089

Camino Balbuena, Xavier Marcote, J. Carlos Valenzuela-Tripodoro, Pedro García-Vázquez

Publication date: 12 February 2009

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2006.04.020

zbMATH Keywords

graceful labelinggraceful treesKotzig conjecture

Mathematics Subject Classification ID

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

Related Items

Construction of an \(\alpha\)-labeled tree from a given set of \(\alpha\)-labeled trees, Binomial trees are graceful, Unnamed Item, Counting and labeling grid related graphs

Cites Work

• All trees of diameter five are graceful
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item