AbstractLet T6 denote the class of all 6-connected (equivalently 6-regular) toroidal graphs and let G∈T6 which is not minor-minimal in T6. Let G′∈T6 be a proper minor of G with maximum number of vertices. We show that |V(G)|−|V(G′)|=fw(G), where fw(G) denotes the face-width of the toroidal embedding of G. Consequently, we show that the only minor-minimal graphs in T6 are K7, K8−4K2, K9−C9, and K9−3K3
AbstractTutte's wheels theorem states that the k-spoked wheel graphs, Wk, are the basic building blo...
The choosability χ`(G) of a graph G is the minimum k such that having k colors available at each ver...
AbstractWe define graphs Yn such that none of these Yn has a minor isomorphic to K8 and for every nu...
AbstractLet T6 denote the class of all 6-connected (equivalently 6-regular) toroidal graphs and let ...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
AbstractWe show that any graph G embedded on the torus with face-width r ≥ 5 contains the toroidal ⌊...
AbstractLet K6 denote the class of all 6-regular graphs which admit an embedding into the Klein bott...
AbstractAn edge of a 6-connected graph is said to be 6-contractible if the contraction of the edge r...
summary:An edge $e$ of a $k$-connected graph $G$ is said to be $k$-removable if $G-e$ is still $k$-c...
AbstractIt is shown that an essentially 6-connected graph G on at least 13 vertices can be contracte...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
Jorgensen conjectured that every 6-connected graph with no K-6 minor has a vertex whose deletion mak...
AbstractThere are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
We first prove a ``non-embeddable extensions' theorem for polyhedral graph embeddings. Let G be a ``...
AbstractTutte's wheels theorem states that the k-spoked wheel graphs, Wk, are the basic building blo...
The choosability χ`(G) of a graph G is the minimum k such that having k colors available at each ver...
AbstractWe define graphs Yn such that none of these Yn has a minor isomorphic to K8 and for every nu...
AbstractLet T6 denote the class of all 6-connected (equivalently 6-regular) toroidal graphs and let ...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
AbstractWe show that any graph G embedded on the torus with face-width r ≥ 5 contains the toroidal ⌊...
AbstractLet K6 denote the class of all 6-regular graphs which admit an embedding into the Klein bott...
AbstractAn edge of a 6-connected graph is said to be 6-contractible if the contraction of the edge r...
summary:An edge $e$ of a $k$-connected graph $G$ is said to be $k$-removable if $G-e$ is still $k$-c...
AbstractIt is shown that an essentially 6-connected graph G on at least 13 vertices can be contracte...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
Jorgensen conjectured that every 6-connected graph with no K-6 minor has a vertex whose deletion mak...
AbstractThere are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
We first prove a ``non-embeddable extensions' theorem for polyhedral graph embeddings. Let G be a ``...
AbstractTutte's wheels theorem states that the k-spoked wheel graphs, Wk, are the basic building blo...
The choosability χ`(G) of a graph G is the minimum k such that having k colors available at each ver...
AbstractWe define graphs Yn such that none of these Yn has a minor isomorphic to K8 and for every nu...