Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Abstract Graph labellings have been used in many applications, such as in the development of redundant arrays of independent… Expand
  • figure 1
  • figure 2
Is this relevant?
2014
2014
We investigate a new graph which is called Step Grid Graph. We prove that the step grid graph is graceful. We have investigate… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
In this paper, we introduce a new class of hanging theta graphs and prove that those graphs admit graceful labeling. 
  • figure 1
  • figure 2
Is this relevant?
2013
2013
In this paper, we prove that the square graph of bistar Bn,n, the splitting graph of Bn,n and the splitting graph of star K1,n… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
This paper takes a close look at graceful labelling and its applications. We pay special attention to the famous Graceful Tree… Expand
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
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… Expand
  • figure 1
Is this relevant?
2006
2006
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be… Expand
  • table 3
  • table 2
  • table 1
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
We establish that all trees on at most 27 vertices admit graceful labellings and all trees on at most 26 vertices admit… Expand
Is this relevant?