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)

Full work available at URL https://doi.org/10.1016/0012-365X(90)90285-P

zbMATH Keywords

n-cubestrongly graceful

Mathematics Subject Classification ID

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

Cited in

(20)

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

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)