On k-graceful, locally finite graphs

DOI10.1016/0095-8956(83)90058-8zbMATH Open0534.05057OpenAlexW2047601102MaRDI QIDQ790132FDOQ790132

Authors: Peter 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

Recommendations

• On k-graceful, countably infinite graphs
• scientific article; zbMATH DE number 13213
• Problems in graph theory: Graceful and sequential numberings of infinite graphs
• scientific article; zbMATH DE number 1895025
• scientific article; zbMATH DE number 5941311

zbMATH Keywords

graceful graphsnumberingsbijectively k- gracefuledge-disjoint odd cycles

Mathematics Subject Classification ID

Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On k-sequential and other numbered graphs
• Permutations of the positive integers with restrictions on the sequence of differences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Labelings of a certain class of convex polytopes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graceful Signed Graphs
• It Is All Labeling
• On k-graceful, countably infinite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790132)