There are two main purposes of this article. First we show that every 3-connected graph embedded in the torus or the Klein bottle has a spanning planar subgraph which is 2-connected, and in fact has a slightly stronger connectivity property. Second, this subgraph is applied to show that every 3-conn
Finding regular subgraphs in both arbitrary and planar graphs
β Scribed by Iain A. Stewart
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 802 KB
- Volume
- 68
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
It is well-known that every planar graph has a vertex of degree at most five. Kotzig proved that every 3-connected planar graph has an edge xy such that deg(x) + deg(y) β€ 13. In this article, considering a similar problem for the case of three or more vertices that induce a connected subgraph, we sh
## Abstract A graph __H__ is light in a given class of graphs if there is a constant __w__ such that every graph of the class which has a subgraph isomorphic to __H__ also has a subgraph isomorphic to __H__ whose sum of degrees in __G__ is β€β__w__. Let $\cal G$ be the class of simple planar graphs