𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independent Trees and Branchings in Planar Multigraphs

✍ Scribed by Andreas Huck

Publisher
Springer Japan
Year
1999
Tongue
English
Weight
164 KB
Volume
15
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Disproof of a conjecture about independe
Disproof of a conjecture about independent branchings in k-connected directed graphs
✍ Andreas Huck πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 248 KB πŸ‘ 1 views

## Abstract For each __k__ β‰₯ 3, we construct a finite directed strongly __k__‐connected graph __D__ containing a vertex __t__ with the following property: For any __k__ spanning __t__‐branchings, __B__~1~, …, __B__~__k__~ in __D__ (i. e., each __B__~__i__~ is a spanning tree in __D__ directed towar

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.