On k-sequential and other numbered graphs

DOI10.1016/0012-365X(81)90066-2zbMATH Open0461.05053MaRDI QIDQ1152385FDOQ1152385

Peter 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)

Cites Work

• Cycles with a chord are graceful
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two theorems on graceful trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Products of graceful trees
• Title not available (Why is that?)
• Two sets of graceful graphs
• Title not available (Why is that?)

Cited In (12)

• Set-Valued Graphs: A Survey
• On $k$-Super Graceful Labeling of Graphs
• 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
• It Is All Labeling
• Sequentially additive graphs
• On k-graceful, countably infinite graphs
• Strongly indexable 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)