Author Publications

Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type
Jump to: Article | Report
Number of items: 38.

Article

Albers, W. and Veldman, H.J. (1984) Adaptive estimation of binomial probabilities under misclassification. Statistica Neerlandica, 38 (4). pp. 233-247. ISSN 0039-0402

Asratian, A.S. and Broersma, H.J. and Heuvel, J. van den and Veldman, H.J. (1996) On graphs satisfying a local ore-type condition. Journal of Graph Theory, 21 (1). pp. 1-10. ISSN 0364-9024

Bauer, D. and Broersma, H.J. and Veldman, H.J. (2000) Not every 2-tough graph is Hamiltonian. Discrete Applied Mathematics, 99 (1-3). pp. 317-321. ISSN 0166-218X

Bauer, D. and Katona, G.Y. and Kratsch, D. and Veldman, H.J. (2000) Chordality and 2-factors in tough graphs. Discrete Mathematics, 99 (1-3). pp. 323-329. ISSN 0012-365X

Bauer, D. and McGuire, L. and Trommel, H. and Veldman, H.J. (2000) Long cycles in 3-cyclable graphs. Discrete Mathematics, 218 (1-3). pp. 1-8. ISSN 0012-365X

Bauer, D. and Schmeichel, E. and Veldman, H.J. (1996) A note on dominating cycles in 2-connected graphs. Discrete Mathematics, 155 (1-3). pp. 13-18. ISSN 0012-365X

Bauer, Douglas and Broersma, H.J. and Heuvel, J. van den and Veldman, H.J. (1995) Long cycles in graphs with prescribed toughness and minimum degree. Discrete Mathematics, 141 (1-3). pp. 1-10. ISSN 0012-365X

Bauer, Douglas and Broersma, H.J. and Veldman, H.J. and Rao, Li (1989) A generalization of a result of Häggkvist and Nicoghossian. Journal of Combinatorial Theory, Series B, 47 (2). pp. 237-243. ISSN 0021-9800

Bauer, Douglas and Fan, Genghua and Veldman, Henk Jan (1991) Hamiltonian properties of graphs with large neighborhood unions. Discrete Mathematics, 96 (1). pp. 33-49. ISSN 0012-365X

Bauer, Douglas and Veldman, H.J. and Morgana, A. and Schmeichel, E.F. (1990) Long cycles in graphs with large degree sums. Discrete Mathematics, 79 (1). pp. 59-70. ISSN 0012-365X

Benhocine, A. and Clark, L. and Köhler, N. and Veldman, H.J. (1986) On circuits and pancyclic line graphs. Journal of Graph Theory, 10 (3). pp. 411-425. ISSN 0364-9024

Blanken, E. van and Heuvel, J. van den and Veldman, H.J. (1995) Pancyclicity of Hamiltonian line graphs. Discrete Mathematics, 138 (1-3). pp. 379-385. ISSN 0012-365X

Brandt, Stephan and Veldman, Henk Jan (1997) Degree sums for edges and cycle lengths in graphs. Journal of Graph Theory, 25 (4). pp. 253-256. ISSN 0364-9024

Broersma, Hajo and Faudree, Ralph J. and Huck, Andreas and Trommel, Huib and Veldman, Henk Jan (2002) Forbidden subgraphs that imply hamiltonian-connectedness. Journal of Graph Theory, 40 (2). pp. 104-119. ISSN 0364-9024

Broersma, H.J. and Faudree, R.J. and Heuvel, J. van den and Veldman, H.J. (1993) Decomposition of bipartite graphs under degree constraints. Networks, 23 (3). pp. 159-164. ISSN 0028-3045

Broersma, H.J. and Heuvel, J. van den and Jackson, B. and Veldman, H.J. (1996) Hamiltonicity of regular 2-connected graphs. Journal of Graph Theory, 22 (2). pp. 105-124. ISSN 0364-9024

Broersma, H.J. and Heuvel, J. van den and Jung, H.A. and Veldman, H.J. (1993) Cycles containing all vertices of maximum degree. Journal of Graph Theory, 17 (3). pp. 373-385. ISSN 0364-9024

Broersma, H.J. and Heuvel, J. van den and Veldman, H.J. (1993) A generalization of Ore's Theorem involving neighborhood unions. Discrete Mathematics, 122 (1-3). pp. 37-49. ISSN 0012-365X

Broersma, H.J. and Heuvel, J. van den and Veldman, H.J. (1993) Long cycles, degree sums and neighborhood unions. Discrete Mathematics, 121 (1-3). pp. 25-35. ISSN 0012-365X

Broersma, H.J. and Veldman, H.J. (1987) 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian. Journal of Graph Theory, 11 (3). pp. 399-407. ISSN 0364-9024

Broersma, H.J. and Veldman, H.J. (1991) Long dominating cycles and paths in graphs with large neighborhood unions. Journal of Graph Theory, 15 (1). pp. 29-38. ISSN 0364-9024

Broersma, Hajo and Li, Hao and Li, Jianping and Tian, Feng and Veldman, Henk Jan (1997) Cycles through subsets with large degree sums. Discrete Mathematics, 171 (1-3). pp. 43-54. ISSN 0012-365X

Brouwer, A.E. and Veldman, H.J. (1987) Contractibility and NP-completeness. Journal of Graph Theory, 11 (1). pp. 71-79. ISSN 0364-9024

Böhme, T. and Broersma, H.J. and Veldman, H.J. (1996) Toughness and longest cycles in 2-connected planar graphs. Journal of Graph Theory, 23 (3). pp. 257-263. ISSN 0364-9024

Göbel, F. and Orestes Cerdeira, J. and Veldman, H.J. (1991) Label-connected graphs and the gossip problem. Discrete Mathematics, 87 (1). pp. 29-40. ISSN 0012-365X

Göbel, F. and Veldman, H.J. (1986) Even graphs. Journal of Graph Theory, 10 (2). pp. 225-239. ISSN 0364-9024

Hoede, C. and Veldman, H.J. (1978) On characterization of Hamiltonian graphs. Journal of Combinatorial Theory, Series B, 25 (1). pp. 47-53. ISSN 0021-9800

Hoede, C. and Veldman, H.J. (1981) Contraction theorems in Hamiltonian graph theory. Discrete Mathematics, 34 (1). pp. 61-67. ISSN 0012-365X

Krol, H.J. and Veldman, H.J. (1983) On maximum critically h-connected graphs. Discrete Mathematics, 52 (2-3). pp. 225-234. ISSN 0012-365X

Trommel, H. and Veldman, H.J. and Verschut, A. (1999) Pancyclicity of claw-free hamiltonian graphs. Discrete Mathematics, 197-198 . pp. 781-789. ISSN 0012-365X

Veldman, H.J. (1992) Cycles containing many vertices of large degree. Discrete Mathematics, 101 (1-3). pp. 319-325. ISSN 0012-365X

Veldman, H.J. (1994) On dominating and spanning circuits in graphs. Discrete Mathematics, 124 (1-3). pp. 229-239. ISSN 0012-365X

Veldman, H.J. (1983) Existence of dominating cycles and paths. Discrete Mathematics, 43 (2-3). pp. 281-296. ISSN 0012-365X

Veldman, H.J. (1983) Non-κ-critical vertices in graphs. Discrete Mathematics, 44 (1). pp. 105-110. ISSN 0012-365X

Veldman, H.J. (1983) Existence of Dλ-cycles and Dλ-paths. Discrete Mathematics, 44 (3). pp. 309-316. ISSN 0012-365X

Veldman, H.J. (1986) Existence of spanning and dominating trails and circuits. Journal of Graph Theory, 10 (1). pp. 23-31. ISSN 0364-9024

Veldman, H.J. (1988) A result on Hamiltonian line graphs involving restrictions on induced subgraphs. Journal of Graph Theory, 12 (3). pp. 413-420. ISSN 0364-9024

Report

Broersma, H.J. and Faudree, R.J. and Huck, A. and Trommel, H. and Veldman, H.J. (1999) Forbidden subgraphs that imply Hamiltonian-connectedness. [Report]

This list was generated on Thu Sep 18 05:39:12 2014 CEST.