Add to ORKGAbstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem: a bipartite graph is planar if and only if it does not contain K3,3 as a bipartite minor. Similarly, we provide a forbidden minor characterization for outerplanar graphs and forests. We then establish a recursive characterization of bipartite (2, 2)-Laman graphs — a certain family of graphs that contains all maximal bipartite planar graphs. 1
This dissertation solves two problems relating to the structure of graphs. The first of these is mot...
A classical result of Robertson and Seymour states that the set of graphs containing a fixed planar ...
AbstractThe purpose of this note is to give a connectivity condition for a graph to have a rooted co...
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
Let G be a 3-connected planar graph and let U ` V (G). It is shown that G contains a K 2;t minor suc...
AbstractThe recent paper ‘Linear connectivity forces large complete bipartite minors’ by Böhme, Kawa...
We provide a complete structural characterization of K2,4-minor-free graphs. The 3-connected K2,4-mi...
AbstractLet G be a 3-connected planar graph and let U⊆V(G). It is shown that G contains a K2, t mino...
AbstractThis paper contains the cornerstone theorem of the series. We study the structure of graphs ...
AbstractIn this paper, we proved the following result: Let G be a (k+2)-connected, non-(k−3)-apex gr...
AbstractLet L be the set of all additive and hereditary properties of graphs. For P1, P2 ∈ L we defi...
In this thesis we adapt fundamental parts of the Graph Minors series of Robertson and Seymour for th...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
AbstractWe show that the only graphs with certain connectivity and planarity properties are the Pete...
This dissertation solves two problems relating to the structure of graphs. The first of these is mot...
A classical result of Robertson and Seymour states that the set of graphs containing a fixed planar ...
AbstractThe purpose of this note is to give a connectivity condition for a graph to have a rooted co...
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
Let G be a 3-connected planar graph and let U ` V (G). It is shown that G contains a K 2;t minor suc...
AbstractThe recent paper ‘Linear connectivity forces large complete bipartite minors’ by Böhme, Kawa...
We provide a complete structural characterization of K2,4-minor-free graphs. The 3-connected K2,4-mi...
AbstractLet G be a 3-connected planar graph and let U⊆V(G). It is shown that G contains a K2, t mino...
AbstractThis paper contains the cornerstone theorem of the series. We study the structure of graphs ...
AbstractIn this paper, we proved the following result: Let G be a (k+2)-connected, non-(k−3)-apex gr...
AbstractLet L be the set of all additive and hereditary properties of graphs. For P1, P2 ∈ L we defi...
In this thesis we adapt fundamental parts of the Graph Minors series of Robertson and Seymour for th...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
AbstractWe show that the only graphs with certain connectivity and planarity properties are the Pete...
This dissertation solves two problems relating to the structure of graphs. The first of these is mot...
A classical result of Robertson and Seymour states that the set of graphs containing a fixed planar ...
AbstractThe purpose of this note is to give a connectivity condition for a graph to have a rooted co...