Planar decomposition of graphs

Authors

Laura Sheppardson, University of Mississippi

Document Type

Lecture

Publication Date

9-25-2003

Abstract

We have fairly strong results on long paths and cycles in graphs which are planar, or embedded in low-genus surfaces. One way to find paths and cycles in more general graphs is to decompose them into planar subgraphs. We'll look at several different approaches to such a decomposition. Results already obtained by a standard surgery method will be presented, and the promise of other methods considered.

Relational Format

presentation

Recommended Citation

Sheppardson, Laura, "Planar decomposition of graphs" (2003). Combinatorics Seminar. 110.
https://egrove.olemiss.edu/math_combinatorics/110