| Article ID | Journal | Published Year | Pages | File Type | 
|---|---|---|---|---|
| 9513122 | Discrete Mathematics | 2005 | 10 Pages | 
Abstract
												The result shows that lower bounds of the maximum genus of graphs with any given connectivity become larger and larger as their minimum degree increases, and complements recent results of several authors.
											Related Topics
												
													Physical Sciences and Engineering
													Mathematics
													Discrete Mathematics and Combinatorics
												
											Authors
												Yuanqiu Huang, Tinglei Zhao, 
											