Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
H.J. Broersma
Information about the author H.J. Broersma 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...
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
2000
A graph is distance hereditary if it preserves distances in all its connected induced...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
