𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Identifying Codes in Trees and Planar Graphs

✍ Scribed by David Auger

Book ID
108120726
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
156 KB
Volume
34
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Identifying Codes in Line Graphs
Identifying Codes in Line Graphs
✍ Florent Foucaud; Sylvain Gravier; Reza Naserasr; Aline Parreau; Petru Valicov πŸ“‚ Article πŸ“… 2012 πŸ› John Wiley and Sons 🌐 English βš– 811 KB
Packing trees into planar graphs
Packing trees into planar graphs
✍ A. GarcΓ­a; C. Hernando; F. Hurtado; M. Noy; J. Tejel πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 108 KB

## Abstract In this study, we provide methods for drawing a tree with __n__ vertices on a convex polygon, without crossings and using the minimum number of edges of the polygon. We apply the results to obtain planar packings of two trees in some specific cases. Β© 2002 Wiley Periodicals, Inc. J Grap

Two trees in maximal planar bipartite gr
Two trees in maximal planar bipartite graphs
✍ Gerhard Ringel πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 127 KB

## Abstract It is proven that each maximal planar bipartite graph is decomposable into two trees. Β© 1993 John Wiley & Sons, Inc.