Strongly graceful graphs

DOI10.1016/0012-365X(90)90285-PzbMath0438.05055MaRDI QIDQ1141665

Maryvonne Maheo

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)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item