Connectivity, traceability and Hamiltonicity (Q2153129)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity, traceability and Hamiltonicity |
scientific article |
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
