Cycles with a chord are graceful
From MaRDI portal
Publication:3852230
Cited in
(8)- On k-sequential and other numbered graphs
- All uniform bow graphs are graceful
- Graceful and cordial labeling of subdivision of graphs
- A survey on the existence ofG-Designs
- Gracefulness of union of cycle with parallel chords and complete bipartite graphs or paths
- Recent developments on gracefulness of graphs. A survey complemented with chessboard representations
- Conservative trees
- Gracefulness of two nested cycles: a first approach
This page was built for publication: Cycles with a chord are graceful
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3852230)