Premium
Cycles with a chord are graceful
Author(s) -
Delorme C.,
Maheo M.,
Thuillier H.,
Koh K. M.,
Teo H. K.
Publication year - 1980
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190040410
Subject(s) - chord (peer to peer) , conjecture , mathematics , combinatorics , discrete mathematics , computer science , computer network
In this paper, we prove that every cycle plus a chord is graceful, thus answering a conjecture of R. Bodendiek, H. Schumacher, and H. Wegner.