Pages that link to "Item:Q2571275"
From MaRDI portal
The following pages link to Lower bound for the size of maximal nontraceable graphs (Q2571275):
Displaying 6 items.
- Hamilton-chain saturated hypergraphs (Q966015) (← links)
- Maximal nontraceable graphs with toughness less than one (Q1010724) (← links)
- The maximum size of a nonhamiltonian graph with given order and connectivity (Q2092432) (← links)
- On the number of edges in a minimum \(C_6\)-saturated graph (Q2354620) (← links)
- The Hamiltonian problem and \(t\)-path traceable graphs (Q2357671) (← links)
- Graphs maximal with respect to absence of hamiltonian paths (Q4254304) (← links)