Skip to search formSkip to main contentSkip to account menu

Graceful labeling

Known as: Graceful (disambiguation), Von Koch's conjecture, Graceful tree conjecture 
In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some subset of the integers between 0 and m inclusive… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
In this paper, we introduce a new class of hanging theta graphs and prove that those graphs admit graceful labeling. 
2012
2012
For a connected graph G of order n ≥ 3, let f : E(G) → Zn be an edge labeling of G. The vertex labeling f ′ : V (G) → Zn induced… 
2011
2011
This paper takes a close look at graceful labelling and its applications. We pay special attention to the famous Graceful Tree… 
2010
2010
In this work some new odd graceful graphs are investigated. We prove that the graph obtained by joining two copies of even cycle… 
2006
2006
A graceful n-permutation is a graceful labeling of an n-vertex path P_n. In this paper we improve the asymptotic lower bound on… 
Review
2006
Review
2006
In a method for controlling a tire vulcanization of a vulcanizing apparatus, an initial green tire temperature is measured before… 
2002
2002
A graph $G$ on $m$ edges is considered graceful if there is a labelling $f$ of the vertices of $G$ with distinct integers in the… 
1998
1998
We establish that all trees on at most 27 vertices admit graceful labellings and all trees on at most 26 vertices admit…