Connectivity, traceability and Hamiltonicity (Q2153129)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Connectivity, traceability and Hamiltonicity |
scientific article; zbMATH DE number 7552241
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connectivity, traceability and Hamiltonicity |
scientific article; zbMATH DE number 7552241 |
Statements
Connectivity, traceability and Hamiltonicity (English)
0 references
1 July 2022
0 references
The authors present sufficient conditions for a connected, triangle-free graph to be 2-connected based on minimum degree and leaf number or minimum degree and order. The established lower bounds are sharp. Sufficient conditions for connectivity, traceability, and Hamiltonicity in triangle-free graphs are deduced.
0 references
leaf number
0 references
minimum degree
0 references
order
0 references
connectivity
0 references
cycles
0 references
paths
0 references
0.8411288261413574
0 references
0.788407027721405
0 references
0.7862265110015869
0 references
0.7805116176605225
0 references
