This dissertation solves some problems relating to the theory of graphs. The first type of problem considered concerns the structure of various classes of graphs which arise naturally from outerplanar graphs. These problems are motivated by Chartrand and Harary\u27s well-known characterization of outerplanar graphs. This theorem states that K$\sb4$ and K$\sb{2,3}$ are the only non-outerplanar graphs for which both G$\\$e, the deletion of the edge e from the graph G, and G/e, the contraction of the edge e, are outerplanar for all edges e of G. Following Gubser\u27s characterization of almost-planar graphs, we begin our study of graphs related to outerplanar graphs by characterizing the non-outerplanar graphs for which G$\\$e or G/e is outerp...
Matroids are discrete mathematical objects that generalize important concepts of independence arisin...
This paper surveys recent work that is aimed at generalising the results and techniques of the Grap...
In this note we characterize all graphs without a 2C3-minor. A consequence of this result is a chara...
This dissertation solves two problems relating to the structure of graphs. The first of these is mot...
This dissertation establishes a number of theorems related to the structure of graphs and, more gene...
The class of outerplanar graphs is minor-closed and can be characterized by two excluded minors: (Fo...
The results of this dissertation consist of excluded-minor results for Binary Matroids and excluded-...
Matroids capture an abstract notion of independence that generalizes linear independence in linear a...
It is well known that every sufficiently large connected graph G has either a vertex of high degree ...
``If a theorem about graphs can be expressed in terms of edges and cycles only, it probably exemplif...
This dissertation solves some problems related to the structure of matroids. In Chapter 2, we prove ...
This paper gives an informal introduction to structure theory for minor- closed classes of matroids...
AbstractIt is easily proved that, if P is a class of graphs that is closed under induced subgraphs, ...
It is easily proved that, if P is a class of graphs that is closed under induced subgraphs, then the...
This dissertation solves some problems involving the structure of matroids. In Chapter 2, the class ...
Matroids are discrete mathematical objects that generalize important concepts of independence arisin...
This paper surveys recent work that is aimed at generalising the results and techniques of the Grap...
In this note we characterize all graphs without a 2C3-minor. A consequence of this result is a chara...
This dissertation solves two problems relating to the structure of graphs. The first of these is mot...
This dissertation establishes a number of theorems related to the structure of graphs and, more gene...
The class of outerplanar graphs is minor-closed and can be characterized by two excluded minors: (Fo...
The results of this dissertation consist of excluded-minor results for Binary Matroids and excluded-...
Matroids capture an abstract notion of independence that generalizes linear independence in linear a...
It is well known that every sufficiently large connected graph G has either a vertex of high degree ...
``If a theorem about graphs can be expressed in terms of edges and cycles only, it probably exemplif...
This dissertation solves some problems related to the structure of matroids. In Chapter 2, we prove ...
This paper gives an informal introduction to structure theory for minor- closed classes of matroids...
AbstractIt is easily proved that, if P is a class of graphs that is closed under induced subgraphs, ...
It is easily proved that, if P is a class of graphs that is closed under induced subgraphs, then the...
This dissertation solves some problems involving the structure of matroids. In Chapter 2, the class ...
Matroids are discrete mathematical objects that generalize important concepts of independence arisin...
This paper surveys recent work that is aimed at generalising the results and techniques of the Grap...
In this note we characterize all graphs without a 2C3-minor. A consequence of this result is a chara...