Labeling

Graceful Tree Conjecture ★★★

Author(s):

Conjecture All trees are graceful

Posted by kintali
updated November 29th, 2020

Question What is the maximum edge density of a graph which has a good edge labeling?

We say that a graph is good-edge-labeling critical, if it has no good edge labeling, but every proper subgraph has a good edge labeling.

Conjecture For every $c<4$ , there is only a finite number of good-edge-labeling critical graphs with average degree less than $c$ .

Posted by DOT
updated February 16th, 2013