The following pages link to Henk Jan Veldman (Q1363685):
Displaying 31 items.
- (Q749550) (redirect page) (← links)
- Long cycles in graphs with large degree sums (Q749553) (← links)
- Non-\(\kappa\)-critical vertices in graphs (Q795056) (← links)
- On maximum critically h-connected graphs (Q801933) (← links)
- Existence of Dlambda-cycles and Dlambda-paths (Q1055432) (← links)
- A generalization of a result of Häggkvist and Nicoghossian (Q1096650) (← links)
- Contraction theorems in Hamiltonian graph theory (Q1146694) (← links)
- Existence of dominating cycles and paths (Q1173098) (← links)
- Hamiltonian properties of graphs with large neighborhood unions (Q1182981) (← links)
- Cycles containing many vertices of large degree (Q1197038) (← links)
- On characterization of Hamiltonian graphs (Q1225064) (← links)
- Pancyclicity of claw-free Hamiltonian graphs (Q1292881) (← links)
- Long cycles, degree sums and neighborhood unions (Q1309446) (← links)
- On dominating and spanning circuits in graphs (Q1313841) (← links)
- A generalization of Ore's Theorem involving neighborhood unions (Q1313847) (← links)
- Cycles through subsets with large degree sums (Q1363686) (← links)
- Pancyclicity of hamiltonian line graphs (Q1842184) (← links)
- Long cycles in graphs with prescribed toughness and minimum degree (Q1894753) (← links)
- \(D_ \lambda\)-cycles in 3-cyclable graphs (Q1906861) (← links)
- A note on dominating cycles in 2-connected graphs (Q1923475) (← links)
- Not every 2-tough graph is Hamiltonian (Q1962051) (← links)
- Chordality and 2-factors in tough graphs (Q1962052) (← links)
- Long cycles in 3-cyclable graphs (Q1978141) (← links)
- Long paths and cycles in tough graphs (Q2366213) (← links)
- (Q3201098) (← links)
- (Q3201099) (← links)
- (Q3211339) (← links)
- ADAPTIVE ESTIMATION OF BINOMIAL PROBABILITIES UNDER MISCLASSIFICATION (Q3345615) (← links)
- Long dominating cycles and paths in graphs with large neighborhood unions (Q3353048) (← links)
- Heavy cycles in weighted graphs (Q4786785) (← links)
- Decomposition of bipartite graphs under degree constraints (Q5287449) (← links)
