Henk Jan Veldman

According to our database, Henk Jan Veldman authored at least 38 papers between 1978 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2002

Forbidden subgraphs that imply hamiltonian-connectedness.

Hajo Broersma, Ralph J. Faudree, Andreas Huck, Huib Trommel, Henk Jan Veldman

J. Graph Theory, 2002

Heavy cycles in weighted graphs.

J. Adrian Bondy, Hajo Broersma, Jan van den Heuvel, Henk Jan Veldman

Discuss. Math. Graph Theory, 2002

2000

Long cycles in 3-cyclable graphs.

Douglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman

Discret. Math., 2000

Chordality and 2-factors in Tough Graphs.

Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman

Discret. Appl. Math., 2000

Not Every 2-tough Graph Is Hamiltonian.

Douglas Bauer, Hajo Broersma, Henk Jan Veldman

Discret. Appl. Math., 2000

1999

Pancyclicity of claw-free hamiltonian graphs.

Huib Trommel, Henk Jan Veldman, A. Verschut

Discret. Math., 1999

1997

Cycles through subsets with large degree sums.

Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman

Discret. Math., 1997

1996

Hamiltonicity of regular 2-connected graphs.

Haitze J. Broersma, Jan van den Heuvel, Bill Jackson, Henk Jan Veldman

J. Graph Theory, 1996

Toughness and longest cycles in 2-connected planar graphs.

Thomas Böhme, Haitze J. Broersma, Henk Jan Veldman

J. Graph Theory, 1996

On graphs satisfying a local ore-type condition.

Armen S. Asratian, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman

J. Graph Theory, 1996

A note on dominating cycles in 2-connected graphs.

Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman

Discret. Math., 1996

1995

<i>D</i>_<i>λ</i>-cycles in 3-cyclable graphs.

Henk Jan Veldman

Graphs Comb., 1995

Pancyclicity of hamiltonian line graphs.

E. van Blanken, Jan van den Heuvel, Henk Jan Veldman

Discret. Math., 1995

Long cycles in graphs with prescribed toughness and minimum degree.

Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman

Discret. Math., 1995

On generalizing a theorem of Jung.

Douglas Bauer, Haitze J. Broersma, Henk Jan Veldman

Ars Comb., 1995

1994

On dominating and spanning circuits in graphs.

Henk Jan Veldman

Discret. Math., 1994

1993

Decomposition of bipartite graphs under degree constraints.

Haitze J. Broersma, Ralph J. Faudree, Jan van den Heuvel, Henk Jan Veldman

Networks, 1993

Cycles containing all vertices of maximum degree.

Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman

J. Graph Theory, 1993

Long paths and cycles in tough graphs.

Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman

Graphs Comb., 1993

A generalization of Ore's Theorem involving neighborhood unions.

Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman

Discret. Math., 1993

Long cycles, degree sums and neighborhood unions.

Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman

Discret. Math., 1993

1992

Cycles containing many vertices of large degree.

Henk Jan Veldman

Discret. Math., 1992

1991

Long dominating cycles and paths in graphs with large neighborhood unions.

Haitze J. Broersma, Henk Jan Veldman

J. Graph Theory, 1991

Label-connected graphs and the gossip problem.

F. Göbel, J. Orestes Cerdeira, Henk Jan Veldman

Discret. Math., 1991

Hamiltonian properties of graphs with large neighborhood unions.

Douglas Bauer, Genghua Fan, Henk Jan Veldman

Discret. Math., 1991

1990

Long cycles in graphs with large degree sums.

Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel

Discret. Math., 1990

1989

A generalization of a result of Häggkvist and Nicoghossian.

Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao

J. Comb. Theory B, 1989

1988

A result on Hamiltonian line graphs involving restrictions on induced subgraphs.

Henk Jan Veldman

J. Graph Theory, 1988

1987

Contractibility and NP-completeness.

Andries E. Brouwer, Henk Jan Veldman

J. Graph Theory, 1987

3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian.

Haitze J. Broersma, Henk Jan Veldman

J. Graph Theory, 1987

1986

Even graphs.

F. Göbel, Henk Jan Veldman

J. Graph Theory, 1986

On circuits and pancyclic line graphs.

Abdelhamid Benhocine, L. Clark, N. Köhler, Henk Jan Veldman

J. Graph Theory, 1986

1984

On maximum critically h-connected graphs.

H. J. Krol, Henk Jan Veldman

Discret. Math., 1984

1983

Existence of D_lambda-cycles and D_lambda-paths.

Henk Jan Veldman

Discret. Math., 1983

Non-kappa-critical vertices in graphs.

Henk Jan Veldman

Discret. Math., 1983

Existence of dominating cycles and paths.

Henk Jan Veldman

Discret. Math., 1983

1981

Contraction theorems in Hamiltonian graph theory.

Cornelis Hoede, Henk Jan Veldman

Discret. Math., 1981

1978

On characterization of Hamiltonian graphs.

Cornelis Hoede, Henk Jan Veldman

J. Comb. Theory B, 1978