On k-graceful, locally finite graphs

DOI10.1016/0095-8956(83)90058-8zbMath0534.05057OpenAlexW2047601102MaRDI QIDQ790132

Peter J. Slater

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(83)90058-8

zbMATH Keywords

numberingsgraceful graphsbijectively k- gracefuledge-disjoint odd cycles

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (4)

On k-graceful, countably infinite graphs ⋮ Labelings of a certain class of convex polytopes ⋮ Graceful Signed Graphs ⋮ It Is All Labeling

Cites Work

• On k-sequential and other numbered graphs
• Permutations of the positive integers with restrictions on the sequence of differences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On k-graceful, locally finite graphs