On k-sequential and other numbered graphs

DOI10.1016/0012-365X(81)90066-2zbMath0461.05053MaRDI QIDQ1152385

Peter J. Slater

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

numberingk-gracefulk-sequential

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (12)

A guide to the graph labeling zoo ⋮ On k-graceful, countably infinite graphs ⋮ A Note On Set-Indexed Graphs ⋮ Set-Valued Graphs: A Survey ⋮ On $k$-Super Graceful Labeling of Graphs ⋮ Strongly indexable graphs ⋮ Graceful Signed Graphs ⋮ Graceful signed graphs: II. The case of signed cycles with connected negative sections ⋮ Further results on set-valued graphs ⋮ Sequentially additive graphs ⋮ On k-graceful, locally finite graphs ⋮ It Is All Labeling

Cites Work

• Two theorems on graceful trees
• Products of graceful trees
• Cycles with a chord are graceful
• Two sets of graceful graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On k-sequential and other numbered graphs