Genus and Other Graph Invariants

Authors

Jinko Kanno, Louisiana Tech University

Document Type

Lecture

Publication Date

10-10-2013

Abstract

The minimal non-embeddable graphs for the torus are unknown (numerous). It may be a good approach to break the toroidal graphs into tractable subclasses and nd obstructions or some characterizations for each subclass. Those subclasses can be: H-minor free toroidal graphs with a small graph H, or the classes having the same number for some graph invariants including non-orientable genus, thickness, outer-thickness, or possibly the essential curve number for toroidal graphs, which will be introduced in this talk.

Relational Format

presentation

Recommended Citation

Kanno, Jinko, "Genus and Other Graph Invariants" (2013). Combinatorics Seminar. 55.
https://egrove.olemiss.edu/math_combinatorics/55