AbstractLet G be a 3-connected planar graph and let U⊆V(G). It is shown that G contains a K2, t minor such that t is large and each vertex of degree 2 in K2, t corresponds to some vertex of U if and only if there is no small face cover of U. This result cannot be extended to 2-connected planar graphs
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
There are numerous results bounding the circumference of certain 3-connected graphs. There is no goo...
AbstractIn this paper, we proved the following result: Let G be a (k+2)-connected, non-(k−3)-apex gr...
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...
Jørgensen conjectured that every 6-connected graph with no K6 minor has a vertex whose deletion make...
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...
AbstractSeveral algorithmic and graph-theoretic developments have focused on the problem of covering...
It has recently been shown that every 3-connected planar graph G contains a cycle of length at least...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
Projective planar graphs can be characterized by a set A of 35 excluded minors. However, these 35 ar...
Given a simple planar graph with tree-width w and side size of the largest square grid minor g, it i...
AbstractGiven a graph G with tree-width ω(G), branch-width β(G), and side size of the largest square...
We provide a complete structural characterization of K2,4-minor-free graphs. The 3-connected K2,4-mi...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
There are numerous results bounding the circumference of certain 3-connected graphs. There is no goo...
AbstractIn this paper, we proved the following result: Let G be a (k+2)-connected, non-(k−3)-apex gr...
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...
Jørgensen conjectured that every 6-connected graph with no K6 minor has a vertex whose deletion make...
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...
Abstract. We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem...
AbstractSeveral algorithmic and graph-theoretic developments have focused on the problem of covering...
It has recently been shown that every 3-connected planar graph G contains a cycle of length at least...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
Projective planar graphs can be characterized by a set A of 35 excluded minors. However, these 35 ar...
Given a simple planar graph with tree-width w and side size of the largest square grid minor g, it i...
AbstractGiven a graph G with tree-width ω(G), branch-width β(G), and side size of the largest square...
We provide a complete structural characterization of K2,4-minor-free graphs. The 3-connected K2,4-mi...
AbstractWe prove that for every planar graph H there is a number w such that every graph with no min...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
There are numerous results bounding the circumference of certain 3-connected graphs. There is no goo...
AbstractIn this paper, we proved the following result: Let G be a (k+2)-connected, non-(k−3)-apex gr...
DOI
Add to ORKG