2000 |
22 | EE | Douglas Bauer,
Hajo Broersma,
Henk Jan Veldman:
Not Every 2-tough Graph Is Hamiltonian.
Discrete Applied Mathematics 99(1-3): 317-321 (2000) |
21 | EE | Douglas Bauer,
Gyula Y. Katona,
Dieter Kratsch,
Henk Jan Veldman:
Chordality and 2-factors in Tough Graphs.
Discrete Applied Mathematics 99(1-3): 323-329 (2000) |
20 | EE | Douglas Bauer,
Linda E. McGuire,
Huib Trommel,
Henk Jan Veldman:
Long cycles in 3-cyclable graphs.
Discrete Mathematics 218(1-3): 1-8 (2000) |
1999 |
19 | EE | Huib Trommel,
Henk Jan Veldman,
A. Verschut:
Pancyclicity of claw-free hamiltonian graphs.
Discrete Mathematics 197-198: 781-789 (1999) |
1997 |
18 | EE | Hajo Broersma,
Hao Li,
Jianping Li,
Feng Tian,
Henk Jan Veldman:
Cycles through subsets with large degree sums.
Discrete Mathematics 171(1-3): 43-54 (1997) |
1996 |
17 | EE | Douglas Bauer,
Edward F. Schmeichel,
Henk Jan Veldman:
A note on dominating cycles in 2-connected graphs.
Discrete Mathematics 155(1-3): 13-18 (1996) |
1995 |
16 | EE | E. van Blanken,
J. van den Heuvel,
Henk Jan Veldman:
Pancyclicity of hamiltonian line graphs.
Discrete Mathematics 138(1-3): 379-385 (1995) |
15 | EE | Douglas Bauer,
H. J. Broersma,
J. van den Heuvel,
Henk Jan Veldman:
Long cycles in graphs with prescribed toughness and minimum degree.
Discrete Mathematics 141(1-3): 1-10 (1995) |
1994 |
14 | EE | Henk Jan Veldman:
On dominating and spanning circuits in graphs.
Discrete Mathematics 124(1-3): 229-239 (1994) |
1993 |
13 | EE | H. J. Broersma,
J. van den Heuvel,
Henk Jan Veldman:
Long cycles, degree sums and neighborhood unions.
Discrete Mathematics 121(1-3): 25-35 (1993) |
12 | EE | H. J. Broersma,
J. van den Heuvel,
Henk Jan Veldman:
A generalization of Ore's Theorem involving neighborhood unions.
Discrete Mathematics 122(1-3): 37-49 (1993) |
1992 |
11 | EE | Henk Jan Veldman:
Cycles containing many vertices of large degree.
Discrete Mathematics 101(1-3): 319-325 (1992) |
1991 |
10 | EE | F. Göbel,
J. Orestes Cerdeira,
Henk Jan Veldman:
Label-connected graphs and the gossip problem.
Discrete Mathematics 87(1): 29-40 (1991) |
9 | EE | Douglas Bauer,
Genghua Fan,
Henk Jan Veldman:
Hamiltonian properties of graphs with large neighborhood unions.
Discrete Mathematics 96(1): 33-49 (1991) |
1990 |
8 | EE | Douglas Bauer,
Henk Jan Veldman,
Aurora Morgana,
Edward F. Schmeichel:
Long cycles in graphs with large degree sums.
Discrete Mathematics 79(1): 59-70 (1990) |
1989 |
7 | EE | Douglas Bauer,
Hajo Broersma,
Henk Jan Veldman,
Li Rao:
A generalization of a result of Häggkvist and Nicoghossian.
J. Comb. Theory, Ser. B 47(2): 237-243 (1989) |
1984 |
6 | EE | H. J. Krol,
Henk Jan Veldman:
On maximum critically h-connected graphs.
Discrete Mathematics 52(2-3): 225-234 (1984) |
1983 |
5 | EE | Henk Jan Veldman:
Existence of dominating cycles and paths.
Discrete Mathematics 43(2-3): 281-296 (1983) |
4 | EE | Henk Jan Veldman:
Non-kappa-critical vertices in graphs.
Discrete Mathematics 44(1): 105-110 (1983) |
3 | EE | Henk Jan Veldman:
Existence of Dlambda-cycles and Dlambda-paths.
Discrete Mathematics 44(3): 309-316 (1983) |
1981 |
2 | EE | Cornelis Hoede,
Henk Jan Veldman:
Contraction theorems in Hamiltonian graph theory.
Discrete Mathematics 34(1): 61-67 (1981) |
1978 |
1 | EE | Cornelis Hoede,
Henk Jan Veldman:
On characterization of Hamiltonian graphs.
J. Comb. Theory, Ser. B 25(1): 47-53 (1978) |