Open Problem Garden - Graceful Tree Conjecture - Comments

Bibliography (re: Graceful Tree Conjecture)

Anonymous — Sun, 29 Nov 2020 11:25:52 +0100

Many, many references on the topic appear in Joseph Gallian's "A Dynamic Survey of Graph Labeling", section 2 ( https://www.combinatorics.org/ds6 ).

Graceful Tree examples (re: Graceful Tree Conjecture)

Anonymous — Mon, 29 Sep 2014 07:04:20 +0200

If you want to develop intuition for a proof, feel free to use this program I wrote (http://bl.ocks.org/NPashaP/7683252). Good luck.

Apllication of graceful labeling (re: Graceful Tree Conjecture)

Anonymous — Sat, 12 Jun 2010 15:41:34 +0200

I want the application of graceful label

graph theory (re: Graceful Tree Conjecture)

Anonymous — Mon, 30 Nov 2009 17:28:37 +0100

Can you pls send some applications of gracefulgraphs

applications of graceful graphs (re: Graceful Tree Conjecture)

Anonymous — Mon, 30 Nov 2009 09:30:26 +0100

can you explain some applications of graceful graphs

Re: Tentative proof (re: Graceful Tree Conjecture)

Robert Samal — Wed, 06 May 2009 16:47:10 +0200

It's a bit worrisome that this is already the eight version on the arXiv ... this probably means that the previous seven versions had some sort of flaw in it ... I haven't read the paper though ...

Tentative proof (re: Graceful Tree Conjecture)

Anonymous — Tue, 05 May 2009 10:44:40 +0200

I just saw this paper on arxiv, entitled "A complete proof of The Graceful Tree Conjecture using the concept of Edge Degree".

I'm surprised to see such a short proof for such a long-standing open problem, but surely people who are a lot more into the subject than I will be able to provide more constructive comments on the paper.

injective labeling (re: Graceful Tree Conjecture)

Anonymous — Tue, 14 Apr 2009 13:52:36 +0200

Rosa (1967) required the labeling to be injective.

graceful labeling of complete bipartite graphs (re: Graceful Tree Conjecture)

Anonymous — Sat, 12 Apr 2008 17:04:24 +0200

how to give a graceful labeling to complete bipartite graph. Can u suggest some efficient algorithm or scheme for that Plz email it to rocky_blt@yahoo.co.in if u have any...

thanx

Re: wording (re: Graceful Tree Conjecture)

rs — Sat, 04 Aug 2007 12:06:38 +0200

Truly, this was unfortunate choice of wording; I corrected it. (Btw to provide a graceful labeling for complete bipartite graphs is quite an easy exercise.)

no duh.. (re: Graceful Tree Conjecture)

Anonymous — Thu, 02 Aug 2007 05:00:29 +0200

I was just pointing out the statement

"...only a very restricted classes of *trees* have been shown to be graceful. *These* restricted classes include...the complete bipartite graph".

doesn't make sense.

not a problem (re: Graceful Tree Conjecture)

Anonymous — Thu, 02 Aug 2007 00:02:41 +0200

graceful labellings are defined for arbitrary graphs, not just trees.

Err.. (re: Graceful Tree Conjecture)

Anonymous — Wed, 01 Aug 2007 22:30:41 +0200

The complete bipartite graph isn't a tree.

Graceful Tree Conjecture

kintali — Fri, 13 Jul 2007 15:40:18 +0200

Author(s):

Subject: Graph Theory » Coloring » Labeling

Conjecture All trees are graceful