Strongly graceful graphs

DOI10.1016/0012-365X(90)90285-PMaRDI QIDQ1141665zbMATH OpenFDO

Authors Maryvonne Mahéo

Publication date 1980

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

n-cubestrongly graceful

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Cited in

(18)

• \(Q_4\)-factorization of \(\lambda K_n\) and \(\lambda K_x(m)\)
• Strong difference families over arbitrary graphs
• On the graceful permutation graphs conjecture
• \(\Theta\)-graceful labelings of partial cubes
• Constructions for cyclic Moebius ladder systems
• On the complexity of testing a graph for n-cube
• The spectrum problem for the connected cubic graphs of order 10
• On partitional and other related graphs
• Q₅‐factorization of λK_n
• Graceful labelings of nearly complete graphs
• Crown graphs and subdivision of ladders are odd graceful
• A survey on the existence ofG-Designs
• On Additive Bases and Harmonious Graphs
• Archimedean graph designs
• Decomposing the complete graph into dodecahedra
• \(d\)-cube decompositions of \(K_n\setminus K_m\)
• Archimedean graph designs. II.
• Results on the graceful game and range-relaxed graceful game

This page was built for publication: Strongly graceful graphs

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