Graph minors. VII. Disjoint paths on a surface
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Spanning trees in locally planar triangulations
Journal of Combinatorial Theory Series B
2-connected spanning subgraphs of planar 3-connected graphs
Journal of Combinatorial Theory Series B
4-connected projective-planar graphs are Hamiltonian
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
2-connected coverings of bounded degree in 3-connected graphs
Journal of Graph Theory
Nonhamiltonian triangulations with large connectivity and representativity
Journal of Combinatorial Theory Series B
On 2-connected spanning subgraphs with low maximum degree
Journal of Combinatorial Theory Series B
Long cycles in graphs on a fixed surface
Journal of Combinatorial Theory Series B
Subgraphs of graphs on surfaces with high representativity
Journal of Combinatorial Theory Series B
A theorem on paths in locally planar triangulations
European Journal of Combinatorics - Special issue: Topological graph theory
2-connected 7-coverings of 3-connected graphs on surfaces
Journal of Graph Theory
Hi-index | 0.00 |
In this paper, we prove that there exists a function a:N"0xR"+-N such that for each @e0, if G is a 4-connected graph embedded on a surface of Euler genus k such that the face-width of G is at least a(k,@e), then G has a 2-connected spanning subgraph with maximum degree at most 3 in which the number of vertices of degree 3 is at most @e|V(G)|. This improves results due to Kawarabayashi, Nakamoto and Ota [K. Kawarabayashi, A. Nakamoto, K. Ota, Subgraphs of graphs on surfaces with high representativity, J. Combin. Theory Ser. B 89 (2003) 207-229], and Bohme, Mohar and Thomassen [T. Bohme, B. Mohar, C. Thomassen, Long cycles in graphs on a fixed surface, J. Combin. Theory Ser. B 85 (2002) 338-347].