### Abstract

This paper proves that the typenumber of a tree T is independent of the number of the pages in a book-embedding, and is equal to either)D(r)| or \D(T)\ + 1, where D(T) is the set of integers which are degrees of the vertices of T. We then completely characterize trees having typenumber |D(r)| and trees having typenumber \D(T)\ +1.

Original language | English |
---|---|

Pages (from-to) | 3-10 |

Number of pages | 8 |

Journal | Discrete Mathematics |

Volume | 253 |

Issue number | 1-3 |

DOIs | |

State | Published - 6 Jun 2002 |

## Fingerprint Dive into the research topics of 'The typenumber of trees'. Together they form a unique fingerprint.

## Cite this

Fu, H-L., & Sun, I. F. (2002). The typenumber of trees.

*Discrete Mathematics*,*253*(1-3), 3-10. https://doi.org/10.1016/S0012-365X(01)00444-7