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

Two new sufficient conditions for Hamilton-connected graphs

โœ Scribed by Zhengsheng Wu

Book ID
105435268
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
1995
Tongue
English
Weight
415 KB
Volume
11
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Sufficient conditions for maximally conn
Sufficient conditions for maximally connected dense graphs
โœ Terunao Soneoka; Hiroshi Nakada; Makoto Imase; Claudine Peyrat ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 764 KB

This paper considers the relations between the connectivity x or the edge-connectivity A of a graph and other parameters such as the number of vertices n, maximum degree A, minimum degree 6, diameter D and girth g. The following sufficient conditions for maximally connected graphs are derived. 6fir