On Triangulating Planar Graphs under the Four-Connectivity Constraint
β Scribed by T. Biedl; G. Kant; M. Kaufmann
- Publisher
- Springer
- Year
- 1997
- Tongue
- English
- Weight
- 284 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract For each pair __s,t__ of natural numbers there exist natural numbers __f(s,t)__ and __g(s,t)__ such that the vertex set of each graph of connectivity at least __f(s,t)__ (respectively minimum degree at least __g(s,t))__ has a decomposition into sets which induce subgraphs of connectivit
## Abstract Every 3βconnected planar, cubic, triangleβfree graph with __n__ vertices has a bipartite subgraph with at least 29__n__/24βββ7/6 edges. The constant 29/24 improves the previously best known constant 6/5 which was considered best possible because of the graph of the dodecahedron. Example
It is shown that a 3-connected planar graph with minimum valency 4 is edge-reconstructible if no 4-vertex is adjacent to a 5-vertex. ## 1. Introduction In this paper, all graphs G=(V(G),E(G)) considered will be finite and simple. A connected graph G is said to have connectivity k o = ko(G) if the