Cites work
- scientific article; zbMATH DE number 3821797 (Why is no real title available?)
- scientific article; zbMATH DE number 3665007 (Why is no real title available?)
- scientific article; zbMATH DE number 3666855 (Why is no real title available?)
- scientific article; zbMATH DE number 3698968 (Why is no real title available?)
- scientific article; zbMATH DE number 3728287 (Why is no real title available?)
- scientific article; zbMATH DE number 3762115 (Why is no real title available?)
- scientific article; zbMATH DE number 3458691 (Why is no real title available?)
- scientific article; zbMATH DE number 3614798 (Why is no real title available?)
- scientific article; zbMATH DE number 3616482 (Why is no real title available?)
- scientific article; zbMATH DE number 3639657 (Why is no real title available?)
- scientific article; zbMATH DE number 3435497 (Why is no real title available?)
- scientific article; zbMATH DE number 3308125 (Why is no real title available?)
- Cycles with a chord are graceful
- Products of graceful trees
- Two sets of graceful graphs
- Two theorems on graceful trees
Cited in
(12)- It is all labeling
- Set-Valued Graphs: A Survey
- Graceful Signed Graphs
- Graceful signed graphs: II. The case of signed cycles with connected negative sections
- A Note On Set-Indexed Graphs
- A guide to the graph labeling zoo
- On k-graceful, locally finite graphs
- Sequentially additive graphs
- On k-graceful, countably infinite graphs
- Strongly indexable graphs
- On \(k\)-super graceful labeling of graphs
- Further results on set-valued graphs
This page was built for publication: On k-sequential and other numbered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152385)
