New families of graphs that have \(\alpha\)-labelings

DOI10.1016/0012-365X(95)00159-TzbMath0876.05086MaRDI QIDQ1363661

Hunter S. Snevily

Publication date: 10 August 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphgraceful labeling\(\alpha\)-labeling\(\beta\)-labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (12)

Edge-decompositions ofK_n,ninto isomorphic copies of a given tree ⋮ Gracefully cultivating trees on a cycle ⋮ \(\alpha\)-labeling number of trees ⋮ A new application of the \(\otimes_h\)-product to \(\alpha\)-labelings ⋮ (Di)graph products, labelings and related results ⋮ Decomposing almost complete graphs by random trees ⋮ Decomposing almost complete graphs by random trees ⋮ Almost Every Tree With m Edges Decomposes K_2m,2m ⋮ Unnamed Item ⋮ Strong labelings of linear forests ⋮ Optimal packings of bounded degree trees ⋮ Folding trees gracefully

Cites Work

• Decompositions of complete graphs into isomorphic cubes
• On the decomposition of n‐cubes into isomorphic trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New families of graphs that have \(\alpha\)-labelings