Not every 2-tough graph is HamiltonianD. Bauer; H.J. Broersma; H.J. Veldman · 2000

Long cycles, degree sums and neighborhood unionsH.J. Broersma; J.van den Heuvel; H.J. Veldman · 1993

A generalization of Ore's Theorem involving neighborhood unionsH.J. Broersma; J. van den Heuvel; H.J. Veldman · 1993

Long cycles in graphs with prescribed toughness and minimum degreeDouglas Bauer; H.J. Broersma; J. van den Heuvel; H.J. Veldman · 1995

Non-κ-critical vertices in graphsH.J. Veldman · 1983

Derivatives of cycloheptatrienylcyclopentadienyltitaniumH.T. Verkouw; M.E.E. Veldman; C.J. Groenenboom; H.O. Van Oven; H.J. De Leifde Meijer · 1975

On characterization of Hamiltonian graphsC. Hoede; H.J. Veldman · 1978