Pages that link to "Item:Q3731630"
From MaRDI portal
The following pages link to Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees (Q3731630):
Displayed 15 items.
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779) (← links)
- Characterizing degree-sum maximal nonhamiltonian bipartite graphs (Q658075) (← links)
- Long cycles in graphs with large degree sums (Q749553) (← links)
- An Ore-type condition for the existence of two disjoint cycles (Q783683) (← links)
- A simple proof of a theorem of Jung (Q918991) (← links)
- Semi-independence number of a graph and the existence of Hamiltonian circuits (Q1088684) (← links)
- On the length of longest dominating cycles in graphs (Q1309474) (← links)
- A degree characterisation of pancyclicity (Q1322211) (← links)
- Cycles through given vertices and closures (Q1422413) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles (Q2953184) (← links)
- A Remark on Hamiltonian Cycles (Q4024478) (← links)
- On the size of maximally non-hamiltonian digraphs (Q5225023) (← links)
- Fan type condition and characterization of Hamiltonian graphs (Q5418542) (← links)