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
We define four minor-closed classes of signed graphs in terms of embeddability in the annulus, proje...
In the field of topology, a graph is a set of vertices with certain vertices connected to each other...
AbstractThe Induced Minor Containment problem takes as input two graphs G and H, and asks whether G ...
AbstractLet T6 denote the class of all 6-connected (equivalently 6-regular) toroidal graphs and let ...
AbstractLet K6 denote the class of all 6-regular graphs which admit an embedding into the Klein bott...
AbstractWe show that any graph G embedded on the torus with face-width r ≥ 5 contains the toroidal ⌊...
AbstractAn edge of a 6-connected graph is said to be 6-contractible if the contraction of the edge r...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
AbstractForbidden minors and subdivisions for toroidal graphs are numerous. We consider the toroidal...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
AbstractFor any graph G embedded on the torus, the face-widthr(G) of G is the minimum number of inte...
The choosability χ`(G) of a graph G is the minimum k such that having k colors available at each ver...
Jørgensen conjectured that every 6-connected graph with no K6 minor has a vertex whose deletion make...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
We define four minor-closed classes of signed graphs in terms of embeddability in the annulus, proje...
In the field of topology, a graph is a set of vertices with certain vertices connected to each other...
AbstractThe Induced Minor Containment problem takes as input two graphs G and H, and asks whether G ...
AbstractLet T6 denote the class of all 6-connected (equivalently 6-regular) toroidal graphs and let ...
AbstractLet K6 denote the class of all 6-regular graphs which admit an embedding into the Klein bott...
AbstractWe show that any graph G embedded on the torus with face-width r ≥ 5 contains the toroidal ⌊...
AbstractAn edge of a 6-connected graph is said to be 6-contractible if the contraction of the edge r...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
AbstractForbidden minors and subdivisions for toroidal graphs are numerous. We consider the toroidal...
We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor...
AbstractFor any graph G embedded on the torus, the face-widthr(G) of G is the minimum number of inte...
The choosability χ`(G) of a graph G is the minimum k such that having k colors available at each ver...
Jørgensen conjectured that every 6-connected graph with no K6 minor has a vertex whose deletion make...
A graph H is a minor of another graph G, denoted by $H\ {\prec\sb{m}}\ G,$ if a graph isomorphic to ...
We define four minor-closed classes of signed graphs in terms of embeddability in the annulus, proje...
In the field of topology, a graph is a set of vertices with certain vertices connected to each other...
AbstractThe Induced Minor Containment problem takes as input two graphs G and H, and asks whether G ...
DOI
Add to ORKG