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

The lower bound of the number of vertices of plane critical graphs

โœ Scribed by G. A. Donets

Publisher
Springer US
Year
1974
Tongue
English
Weight
819 KB
Volume
7
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Probabilistic lower bound on the indep
A Probabilistic lower bound on the independence number of graphs
โœ Stanley M. Selkow ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 124 KB

Caro (1979) and Wei (1981) established a bound on the size of an independent set of a graph as a function of its degrees. In case the degrees of each vertex's neighbors are also known, we establish a lower bound which is tighter for most graphs.

A lower bound on the number of spanning
A lower bound on the number of spanning trees with k end-vertices
โœ Katherine Heinrich; Guizhen Liu ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 286 KB ๐Ÿ‘ 1 views

If a graph G with cycle rank p contains both spanning trees with rn and with n end-vertices, rn < n, then G has at least 2p spanning trees with k end-vertices for each integer k, rn < k < n. Moreover, the lower bound of 2p is best possible. [ l ] and Schuster [4] independently proved that such span

Bounds on the lower size of A 7-critical
Bounds on the lower size of A 7-critical graph
โœ Huanping Liu; Zhongfu Zhang; Dean Shen ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Institute of Applied Mathematics, Chinese Academy ๐ŸŒ English โš– 307 KB