๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The New Lower Bound of the Number of Vertices of Degree 5 in Contraction Critical 5-Connected Graphs

โœ Scribed by Tingting Li; Jianji Su

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
201 KB
Volume
26
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Vertices of degree 6 in a contraction cr
Vertices of degree 6 in a contraction critically 6-connected graph
โœ Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 378 KB

An edge of a 6-connected graph is said to be 6-contractible if the contraction of the edge results in a 6-connected graph. A contraction critically 6-connected graph is a 6-connected graph with no 6-contractible edge. We prove that each contraction critically 6-connected graph G has at least 1 7 |V

Bounding the number of embeddings of 5-c
Bounding the number of embeddings of 5-connected projective-planar graphs
โœ Shigeru Kitakubo ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 268 KB

A graph is said to be projective-planar if it is nonplanar and is embeddable in a projective plane. In this paper we show that the numbers of projectiveplanar embeddings (up to equivalence) of all 5-connected graphs have an upper bound c( 1120).