Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
H.J. Veldman
Information about the author H.J. Veldman will soon be added to the site.
Found
2 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Not every 2-tough graph is Hamiltonian
2000
We present (9/4–•)-tough graphs without a Hamilton path for arbitrary...
Chordality and 2-factors in tough graphs
2000
A graph G is chordal if it contains no chordless cycle of length at least four and is...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
