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

Minimal bricks have many vertices of small degree

โœ Scribed by Bruhn, Henning; Stein, Maya


Book ID
122806745
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
408 KB
Volume
36
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Small degree vertices in minimal bricks
โœ Bruhn, Henning; Stein, Maya ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 183 KB
Cycles containing many vertices of large
โœ H.J. Veldman ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 446 KB

Veldman, H.J., Cycles containing many vertices of large degree, Discrete Mathematics 101 (1992) 319-325. Let G be a 2-connected graph of order n, r a real number and V, = {u E V(G) ( d(v) 3 r}.

Vertices of Small Degree in Uniquely Ham
โœ J.A. Bondy; Bill Jackson ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 206 KB

Let G be a uniquely hamiltonian graph on n vertices. We show that G has a vertex of degree at most c log 2 8n+3, where c=(2&log 2 3) &1 r2.41. We show further that G has at least two vertices of degree less than four if it is planar and at least four vertices of degree two if it is bipartite.

Small schemes and varieties of minimal d
โœ Eisenbud, David.; Green, M.; Hulek, Klaus.; Popescu, Sorin ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Hopkins University Press ๐ŸŒ English โš– 447 KB