Abstract
dc:descriptionA graph H is a minor of another graph G, denoted by H {\prec\sb{m}} G, if a graph isomorphic to H can be obtained from G by a series of vertex deletions, edge deletions, and edge contractions. Graph minors have been studied for several decades as a way of characterizing classes of graphs. Recent work by Robertson and Seymour has provided further motivation for studying both mathematical and computational aspects of graph minor theory.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Computer Science
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2011
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- McGuinness, Patrick James
- Contributors dc:contributor
-
- Brown, Donna J.
Subjects
dc:subject × 2Rights
dc:rights- Statement dc:rights
-
- Copyright 1992 McGuinness, Patrick James
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
-
AAI9236539
(UMI)AAI9236539 - OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/19190