Lobsters with an almost perfect matching are graceful

zbMATH Open1320.05104arXiv1402.3994MaRDI QIDQ5500155

Elliot Krop

Publication date: 5 August 2015

Abstract: Let $T$ be a lobster with a matching that covers all but one vertex. We show that in this case, $T$ is graceful.

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

zbMATH Keywords

matchinggraceful labelinggraceful tree conjecture

Mathematics Subject Classification ID

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

Related Items (4)

LOBSTERS, CRABS, AND THE ABWEHR ENIGMA ⋮ Improved bounds for relaxed graceful trees ⋮ On \(\alpha\)-labellings of lobsters and trees with a perfect matching ⋮ Title not available (Why is that?)

This page was built for publication: Lobsters with an almost perfect matching are graceful

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