2-connected spanning subgraphs of planar 3-connected graphs
Journal of Combinatorial Theory Series B
2-connected coverings of bounded degree in 3-connected graphs
Journal of Graph Theory
On 2-connected spanning subgraphs with low maximum degree
Journal of Combinatorial Theory Series B
Subgraphs with restricted degrees of their vertices in planar graphs
Discrete Mathematics
On 3-connected plane graphs without triangular faces
Journal of Combinatorial Theory Series B
Subgraph with restricted degrees of their vertices in large polyhedral maps on compact two-manifolds
European Journal of Combinatorics
A local property of polyhedral maps on compact two-dimensional manifolds
Discrete Mathematics
Light subgraphs of multigraphs on compact 2-dimensional manifolds
Discrete Mathematics
Hi-index | 0.00 |
Let g(M) be the family of all 3-connected graphs which can be embedded in a compact 2-manifold M with Euler characteristic χ(M) G ∈ g(M) having a k-path, a path on k-vertices, k≥4, contains a k-path Pk such that its maximum degree ΔG(Pk) in G satisfies ΔG(Pk) ≤ 2 + ⌊(6k - 6 - 2ε)(1 + |χ(M)|/3)⌋, where ε = 0 for even k and ε = 1 for odd k. This bound is best possible. 2. Each graph G ∈ g(M) of order at least k ≥ 5 contains a connected subgraph H of order k such that its maximum degree ΔG(H) satisfies ΔG(H) ≤ 2 + ⌊(4k - 2)(1 + |χ(M)|/3)⌋. This bound is best possible.The sharp values of ΔG(Pk) and ΔG(H) are determined for k ∈ {2, 3, 4} as well.