Henk Jan Veldman

Publication Activity (10 Years)

Years Active: 1978-2002
Publications (10 Years): 0

Publications

J. Adrian Bondy, Hajo Broersma, Jan van den Heuvel, Henk Jan Veldman
Heavy cycles in weighted graphs. Discuss. Math. Graph Theory 22 (1) (2002)
Hajo Broersma, Ralph J. Faudree, Andreas Huck, Huib Trommel, Henk Jan Veldman
Forbidden subgraphs that imply hamiltonian-connectedness. J. Graph Theory 40 (2) (2002)
Douglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman
Long cycles in 3-cyclable graphs. Discret. Math. 218 (1-3) (2000)
Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman
Chordality and 2-factors in Tough Graphs. Discret. Appl. Math. 99 (1-3) (2000)
Douglas Bauer, Hajo Broersma, Henk Jan Veldman
Not Every 2-tough Graph Is Hamiltonian. Discret. Appl. Math. 99 (1-3) (2000)
Huib Trommel, Henk Jan Veldman, A. Verschut
Pancyclicity of claw-free hamiltonian graphs. Discret. Math. (1999)
Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman
Cycles through subsets with large degree sums. Discret. Math. 171 (1-3) (1997)
Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman
A note on dominating cycles in 2-connected graphs. Discret. Math. 155 (1-3) (1996)
Thomas Böhme, Haitze J. Broersma, Henk Jan Veldman
Toughness and longest cycles in 2-connected planar graphs. J. Graph Theory 23 (3) (1996)
Haitze J. Broersma, Jan van den Heuvel, Bill Jackson, Henk Jan Veldman
Hamiltonicity of regular 2-connected graphs. J. Graph Theory 22 (2) (1996)
Armen S. Asratian, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
On graphs satisfying a local ore-type condition. J. Graph Theory 21 (1) (1996)
Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
Long cycles in graphs with prescribed toughness and minimum degree. Discret. Math. 141 (1-3) (1995)
Henk Jan Veldman
-cycles in 3-cyclable graphs. Graphs Comb. 11 (4) (1995)
E. van Blanken, Jan van den Heuvel, Henk Jan Veldman
Pancyclicity of hamiltonian line graphs. Discret. Math. 138 (1-3) (1995)
Douglas Bauer, Haitze J. Broersma, Henk Jan Veldman
On generalizing a theorem of Jung. Ars Comb. 40 (1995)
Henk Jan Veldman
On dominating and spanning circuits in graphs. Discret. Math. 124 (1-3) (1994)
Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
Long cycles, degree sums and neighborhood unions. Discret. Math. 121 (1-3) (1993)
Haitze J. Broersma, Jan van den Heuvel, H. A. Jung, Henk Jan Veldman
Cycles containing all vertices of maximum degree. J. Graph Theory 17 (3) (1993)
Haitze J. Broersma, Ralph J. Faudree, Jan van den Heuvel, Henk Jan Veldman
Decomposition of bipartite graphs under degree constraints. Networks 23 (3) (1993)
Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
A generalization of Ore's Theorem involving neighborhood unions. Discret. Math. 122 (1-3) (1993)
Haitze J. Broersma, Jan van den Heuvel, H. A. Jung, Henk Jan Veldman
Long paths and cycles in tough graphs. Graphs Comb. 9 (1) (1993)
Henk Jan Veldman
Cycles containing many vertices of large degree. Discret. Math. 101 (1-3) (1992)
Haitze J. Broersma, Henk Jan Veldman
Long dominating cycles and paths in graphs with large neighborhood unions. J. Graph Theory 15 (1) (1991)
F. Göbel, J. Orestes Cerdeira, Henk Jan Veldman
Label-connected graphs and the gossip problem. Discret. Math. 87 (1) (1991)
Douglas Bauer, Genghua Fan, Henk Jan Veldman
Hamiltonian properties of graphs with large neighborhood unions. Discret. Math. 96 (1) (1991)
Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel
Long cycles in graphs with large degree sums. Discret. Math. 79 (1) (1990)
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) (1989)
Henk Jan Veldman
A result on Hamiltonian line graphs involving restrictions on induced subgraphs. J. Graph Theory 12 (3) (1988)
Haitze J. Broersma, Henk Jan Veldman
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian. J. Graph Theory 11 (3) (1987)
Andries E. Brouwer, Henk Jan Veldman
Contractibility and NP-completeness. J. Graph Theory 11 (1) (1987)
F. Göbel, Henk Jan Veldman
Even graphs. J. Graph Theory 10 (2) (1986)
Abdelhamid Benhocine, L. Clark, N. Köhler, Henk Jan Veldman
On circuits and pancyclic line graphs. J. Graph Theory 10 (3) (1986)
H. J. Krol, Henk Jan Veldman
On maximum critically h-connected graphs. Discret. Math. 52 (2-3) (1984)
Henk Jan Veldman
Existence of dominating cycles and paths. Discret. Math. 43 (2-3) (1983)
Henk Jan Veldman
Non-kappa-critical vertices in graphs. Discret. Math. 44 (1) (1983)
Henk Jan Veldman
-paths. Discret. Math. 44 (3) (1983)
Cornelis Hoede, Henk Jan Veldman
Contraction theorems in Hamiltonian graph theory. Discret. Math. 34 (1) (1981)
Cornelis Hoede, Henk Jan Veldman
On characterization of Hamiltonian graphs. J. Comb. Theory, Ser. B 25 (1) (1978)