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

On the Existence of a Long Path Between Specified Vertices in a 2-Connected Graph

โœ Scribed by Kazuhide Hirohata

Publisher
Springer Japan
Year
2000
Tongue
English
Weight
78 KB
Volume
16
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Long paths through four vertices in a 2-
Long paths through four vertices in a 2-connected graph
โœ Barovich, Mark V. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 252 KB ๐Ÿ‘ 2 views

Let G be a 2-connected graph, let u and v be distinct vertices in V (G), and let X be a set of at most four vertices lying on a common (u

A remark on the number of vertices of de
A remark on the number of vertices of degree k in a minimally k-edge-connected graph
โœ Mao-cheng Cai ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 395 KB

Let G be a minimally k-edge-connected simple graph and u\*(G) be the number of vertices of degree k in G. proved that (i) uk(G) 2 l(jGl -1)/(2k + l)] + k + 1 for even k, and (ii) uI(G) 2 [lGl/(k + l)] + k for odd k 35 and u,(G) 2 lZlGl/(k + l)] + k -2 for odd k 27, where ICI denotes the number of v

The existence of a 2-factor in K1, n-fre
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity
โœ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 130 KB ๐Ÿ‘ 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n โ‰ฅ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.