Henk Jan Veldman

37 papers Journal 37
YearRankTypeTitle / Venue / Authors
2002 J jnl
Forbidden subgraphs that imply hamiltonian-connectedness.
J. Graph Theory
Hajo Broersma, Ralph J. Faudree, Andreas Huck, Huib Trommel, Henk Jan Veldman
2002 J jnl
Heavy cycles in weighted graphs.
Discuss. Math. Graph Theory
J. Adrian Bondy, Hajo Broersma, Jan van den Heuvel, Henk Jan Veldman
2000 J jnl
Chordality and 2-factors in Tough Graphs.
Discret. Appl. Math.
Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman
2000 J jnl
Long cycles in 3-cyclable graphs.
Discret. Math.
Douglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman
2000 J jnl
Not Every 2-tough Graph Is Hamiltonian.
Discret. Appl. Math.
Douglas Bauer, Hajo Broersma, Henk Jan Veldman
1999 J jnl
Pancyclicity of claw-free hamiltonian graphs.
Discret. Math.
Huib Trommel, Henk Jan Veldman, A. Verschut
1997 J jnl
Cycles through subsets with large degree sums.
Discret. Math.
Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman
1996 J jnl
A note on dominating cycles in 2-connected graphs.
Discret. Math.
Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman
1996 J jnl
Hamiltonicity of regular 2-connected graphs.
J. Graph Theory
Haitze J. Broersma, Jan van den Heuvel, Bill Jackson, Henk Jan Veldman
1996 J jnl
On graphs satisfying a local ore-type condition.
J. Graph Theory
Armen S. Asratian, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
1996 J jnl
Toughness and longest cycles in 2-connected planar graphs.
J. Graph Theory
Thomas Böhme, Haitze J. Broersma, Henk Jan Veldman
1995 J jnl
Long cycles in graphs with prescribed toughness and minimum degree.
Discret. Math.
Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
1995 J jnl
On generalizing a theorem of Jung.
Ars Comb.
Douglas Bauer, Haitze J. Broersma, Henk Jan Veldman
1995 J jnl
Pancyclicity of hamiltonian line graphs.
Discret. Math.
E. van Blanken, Jan van den Heuvel, Henk Jan Veldman
1994 J jnl
On dominating and spanning circuits in graphs.
Discret. Math.
Henk Jan Veldman
1993 J jnl
A generalization of Ore's Theorem involving neighborhood unions.
Discret. Math.
Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
1993 J jnl
Cycles containing all vertices of maximum degree.
J. Graph Theory
Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman
1993 J jnl
Decomposition of bipartite graphs under degree constraints.
Networks
Haitze J. Broersma, Ralph J. Faudree, Jan van den Heuvel, Henk Jan Veldman
1993 J jnl
Long cycles, degree sums and neighborhood unions.
Discret. Math.
Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
1993 J jnl
Long paths and cycles in tough graphs.
Graphs Comb.
Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman
1992 J jnl
Cycles containing many vertices of large degree.
Discret. Math.
Henk Jan Veldman
1991 J jnl
Hamiltonian properties of graphs with large neighborhood unions.
Discret. Math.
Douglas Bauer, Genghua Fan, Henk Jan Veldman
1991 J jnl
Label-connected graphs and the gossip problem.
Discret. Math.
F. Göbel, J. Orestes Cerdeira, Henk Jan Veldman
1991 J jnl
Long dominating cycles and paths in graphs with large neighborhood unions.
J. Graph Theory
Haitze J. Broersma, Henk Jan Veldman
1990 J jnl
Long cycles in graphs with large degree sums.
Discret. Math.
Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel
1989 J jnl
A generalization of a result of Häggkvist and Nicoghossian.
J. Comb. Theory B
Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao
1988 J jnl
A result on Hamiltonian line graphs involving restrictions on induced subgraphs.
J. Graph Theory
Henk Jan Veldman
1987 J jnl
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian.
J. Graph Theory
Haitze J. Broersma, Henk Jan Veldman
1987 J jnl
Contractibility and NP-completeness.
J. Graph Theory
Andries E. Brouwer, Henk Jan Veldman
1986 J jnl
Even graphs.
J. Graph Theory
F. Göbel, Henk Jan Veldman
1986 J jnl
On circuits and pancyclic line graphs.
J. Graph Theory
Abdelhamid Benhocine, L. Clark, N. Köhler, Henk Jan Veldman
1984 J jnl
On maximum critically h-connected graphs.
Discret. Math.
H. J. Krol, Henk Jan Veldman
1983 J jnl
Existence of D
Discret. Math.
Henk Jan Veldman
1983 J jnl
Existence of dominating cycles and paths.
Discret. Math.
Henk Jan Veldman
1983 J jnl
Non-kappa-critical vertices in graphs.
Discret. Math.
Henk Jan Veldman
1981 J jnl
Contraction theorems in Hamiltonian graph theory.
Discret. Math.
Cornelis Hoede, Henk Jan Veldman
1978 J jnl
On characterization of Hamiltonian graphs.
J. Comb. Theory B
Cornelis Hoede, Henk Jan Veldman