Publications in 2000

 

Journal papers
-
Bauer, D., H.J. Broersma en H.J. Veldman,
Not every 2-tough graph is hamiltonian,
Discrete Applied Math. 99 (2000) 317-321.
-
Broersma, H.J., E. Dahlhaus en T. Kloks,
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs,
Discrete Applied Math. 99 (2000) 367-400.
-
Broersma, H.J., A. Huck, T. Kloks, O. Koppius, D. Kratsch, H. Müller en H. Tuinstra,
Degree-preserving forests,
Networks 35 (2000) 26-39.
-
Broersma, H.J., Z. Ryjácek en I. Schiermeyer,
Closure concepts - a survey,
Graphs and Combinatorics 16 (2000) 17-48.
-
Zhang, S., X. Li en H.J. Broersma,
Heavy paths and cycles in weighted graphs,
Discrete Math. 223 (2000) 327-336.

   
Internal reports
-
Broersma, H.J., S. Zhang, X. Li en L. Wang,
A Fan type condition for heavy cycles in weighted graphs,
Memorandum No. 1513 (Februari 2000). pdf-file
-
Broersma, H.J., S. Zhang en X. Li,
$\sigma _3$ type condition for heavy cycles in weighted graphs,
Memorandum No. 1514 (Februari 2000). pdf-file
-
Bauer, D., H.J. Broersma en E. Schmeichel,
More progress on tough graphs - The Y2K report,
Memorandum No. 1536 (Augustus 2000). pdf-file
-
Li, X., S. Zhang, en H.J. Broersma,
Directed paths with few or many colors in colored directed graphs,
Memorandum No. 1543 (September 2000). pdf-file