On the genus and thickness of graphs
β Scribed by Kouhei Asano
- Book ID
- 107884249
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 306 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorientable embedding is disproved.
In this paper, we obtain a relation between the spectral radius and the genus of a graph. In particular, we give upper bounds on the spectral radius of graphs with \(n\) vertices and small genus. " " 1995 Academic Press. Ins
This paper shows how to construct infinitely many regular graphs of degrees five and six having given genus y > 0, which settles favorably Conjecture 1 stated by T. W. Tucker. Tucker has shown that there are infinitely many regular graphs of degrees four and three of arbitrary given genus (Theorem 1