3-Connected Graph of Path-Width at Most Three

Authors

Stan Dziobiak, University of Mississippi

Document Type

Lecture

Publication Date

9-8-2011

Abstract

It is known that the list of excluded minors for the minor-closed class of graphs of path-width 3 numbers in the millions. However, if we restrict our class to 3-connected graphs of path-width 3, then we can characterize it by ve excluded minors.

Relational Format

presentation

Recommended Citation

Dziobiak, Stan, "3-Connected Graph of Path-Width at Most Three" (2011). Combinatorics Seminar. 68.
https://egrove.olemiss.edu/math_combinatorics/68