𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Score sets in oriented 3-partite graphs

✍ Scribed by S. Pirzada; Merajuddin; T. A. Naikoo

Publisher
Springer
Year
2007
Tongue
English
Weight
74 KB
Volume
23
Category
Article
ISSN
1573-8175

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Score sequences in oriented graphs
Score sequences in oriented graphs
✍ S. Pirzada; T. A. Naikoo; N. A. Shah πŸ“‚ Article πŸ“… 2007 πŸ› Springer-Verlag 🌐 English βš– 159 KB
Long cycles in 3-connected graphs in ori
Long cycles in 3-connected graphs in orientable surfaces
✍ Laura Sheppardson; Xingxing Yu πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 157 KB πŸ‘ 1 views

## Abstract In this article, we apply a cutting theorem of Thomassen to show that there is a function __f__: N β†’ N such that if __G__ is a 3‐connected graph on __n__ vertices which can be embedded in the orientable surface of genus __g__ with face‐width at least __f__(__g__), then __G__ contains a