Name
Abstract | ||
|---|---|---|
. This paper concerns the maximum genus orientablesurface upon which a given graph cellularly embeds. Classicaltheorems of Xuong and Nebesk'y give exact values for the maximumgenus. The former is suited to constructing embeddingswhile the latter is suited to forbidding embeddings of larger genus.However, using either theorem alone requires an exhaustive searchto establish the exact value. Herein we examine relative embeddingsof graphs, where certain facial cycles and their... |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1006/jctb.1997.1810 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
type characterization,relative maximum genus | Discrete mathematics,Graph,Combinatorics,Brute-force search,Genus (mathematics),Mathematics | Journal |
Volume | Issue | ISSN |
73 | 1 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
2 | 0.52 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dan Archdeacon | 1 | 277 | 50.72 |
| C. Paul Bonnington | 2 | 100 | 19.95 |
| Jozef Širáň | 3 | 362 | 54.24 |