Brankovic, L.; Rosa, A. and Siran, J.
(2005).
*Journal of Combinatorial Mathematics and Combinatorial Computing*, 55 pp. 159–169.

URL: | http://www.zentralblatt-math.org/zmath/search/?an=... |
---|---|

Google Scholar: | Look up in Google Scholar |

## Abstract

If is a tree on vertex set , where , a labelling of is a bijection from to . The labelling induces an edge labelling by for . The size of the labelling is . A labelling is graceful if its size is . The famous graceful tree conjecture states that every tree has a graceful labelling. This conjecture is open even for trees with maximum degree 3. A labelling of is bipartite, if there is real number that separates the labels of the natural 2-coloration of , i.e. labels from one class are below, labels from the other class are above the number. The gracesize gs is the maximum size of a labelling of , and the -size is the maximum size of a bipartite labelling of . It is not true that were always . However the paper shows that for trees with maximum degree 3 we have . Perhaps it is for some constant .

Item Type: | Journal Article |
---|---|

ISSN: | 0835-3026 |

Academic Unit/Department: | Mathematics, Computing and Technology > Mathematics and Statistics Mathematics, Computing and Technology |

Item ID: | 8077 |

Depositing User: | Jozef Širáň |

Date Deposited: | 15 Jun 2007 |

Last Modified: | 14 Jan 2016 16:32 |

URI: | http://oro.open.ac.uk/id/eprint/8077 |

Share this page: |