Henk Jan Veldman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

2002

Heavy cycles in weighted graphsJohn Adrian Bondy, Hajo Broersma, Jan van den Heuvel, Henk Jan Veldman. dmgt, 22(1):7-15, 2002. [doi]

Forbidden subgraphs that imply hamiltonian-connectednessHajo Broersma, Ralph J. Faudree, Andreas Huck, Huib Trommel, Henk Jan Veldman. jgt, 40(2):104-119, 2002. [doi]

2000

Long cycles in 3-cyclable graphsDouglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman. DM, 218(1-3):1-8, 2000. [doi]

Not Every 2-tough Graph Is HamiltonianDouglas Bauer, Hajo Broersma, Henk Jan Veldman. DAM, 99(1-3):317-321, 2000. [doi]

Chordality and 2-factors in Tough GraphsDouglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman. DAM, 99(1-3):323-329, 2000. [doi]

1999

Pancyclicity of claw-free hamiltonian graphsHuib Trommel, Henk Jan Veldman, A. Verschut. DM, 197-198:781-789, 1999. [doi]

1997

Cycles through subsets with large degree sumsHajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman. DM, 171(1-3):43-54, 1997. [doi]

1996

On graphs satisfying a local ore-type conditionArmen S. Asratian, H. J. Broersma, Jan van den Heuvel, Henk Jan Veldman. jgt, 21(1):1-10, 1996. [doi]

A note on dominating cycles in 2-connected graphsDouglas Bauer, Edward F. Schmeichel, Henk Jan Veldman. DM, 155(1-3):13-18, 1996. [doi]

Hamiltonicity of regular 2-connected graphsH. J. Broersma, Jan van den Heuvel, B. Jackson, Henk Jan Veldman. jgt, 22(2):105-124, 1996. [doi]

Toughness and longest cycles in 2-connected planar graphsThomas Böhme, H. J. Broersma, Henk Jan Veldman. jgt, 23(3):257-263, 1996. [doi]

1995

Long cycles in graphs with prescribed toughness and minimum degreeDouglas Bauer, H. J. Broersma, J. van den Heuvel, Henk Jan Veldman. DM, 141(1-3):1-10, 1995. [doi]

On generalizing a theorem of JungDouglas Bauer, H. J. Broersma, Henk Jan Veldman. arscom, 40, 1995.

Pancyclicity of hamiltonian line graphsE. van Blanken, J. van den Heuvel, Henk Jan Veldman. DM, 138(1-3):379-385, 1995. [doi]

λ-cycles in 3-cyclable graphsHenk Jan Veldman. gc, 11(4):379-388, 1995. [doi]

1994

On dominating and spanning circuits in graphsHenk Jan Veldman. DM, 124(1-3):229-239, 1994. [doi]

1993

Long cycles, degree sums and neighborhood unionsH. J. Broersma, J. van den Heuvel, Henk Jan Veldman. DM, 121(1-3):25-35, 1993. [doi]

A generalization of Ore s Theorem involving neighborhood unionsH. J. Broersma, J. van den Heuvel, Henk Jan Veldman. DM, 122(1-3):37-49, 1993. [doi]

Long paths and cycles in tough graphsH. J. Broersma, Jan van den Heuvel, H. A. Jung, Henk Jan Veldman. gc, 9(1):3-17, 1993. [doi]

Cycles containing all vertices of maximum degreeH. J. Broersma, Johan H. C. van den Heuvel, H. A. Jung, Henk Jan Veldman. jgt, 17(3):373-385, 1993. [doi]

Decomposition of bipartite graphs under degree constraintsH. J. Broersma, Ralph J. Faudree, Johan H. C. van den Heuvel, Henk Jan Veldman. networks, 23(3):159-164, 1993. [doi]

1992

Cycles containing many vertices of large degreeHenk Jan Veldman. DM, 101(1-3):319-325, 1992. [doi]

1991

Hamiltonian properties of graphs with large neighborhood unionsDouglas Bauer, Genghua Fan, Henk Jan Veldman. DM, 96(1):33-49, 1991. [doi]

Long dominating cycles and paths in graphs with large neighborhood unionsH. J. Broersma, Henk Jan Veldman. jgt, 15(1):29-38, 1991. [doi]

Label-connected graphs and the gossip problemF. Göbel, J. Orestes Cerdeira, Henk Jan Veldman. DM, 87(1):29-40, 1991. [doi]

1990

Long cycles in graphs with large degree sumsDouglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel. DM, 79(1):59-70, 1990. [doi]

1989

A generalization of a result of Häggkvist and NicoghossianDouglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao. JCT, 47(2):237-243, 1989. [doi]

1988

A result on Hamiltonian line graphs involving restrictions on induced subgraphsHenk Jan Veldman. jgt, 12(3):413-420, 1988. [doi]

1987

3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonianH. J. Broersma, Henk Jan Veldman. jgt, 11(3):399-407, 1987. [doi]

Contractibility and NP-completenessA. E. Brouwer, Henk Jan Veldman. jgt, 11(1):71-79, 1987. [doi]

1986

On circuits and pancyclic line graphsAbdelhamid Benhocine, L. Clark, N. Köhler, Henk Jan Veldman. jgt, 10(3):411-425, 1986. [doi]

Even graphsF. Göbel, Henk Jan Veldman. jgt, 10(2):225-239, 1986. [doi]

1984

On maximum critically h-connected graphsH. J. Krol, Henk Jan Veldman. DM, 52(2-3):225-234, 1984. [doi]

1983

Non-kappa-critical vertices in graphsHenk Jan Veldman. DM, 44(1):105-110, 1983. [doi]

Existence of D::lambda::-cycles and D::lambda::-pathsHenk Jan Veldman. DM, 44(3):309-316, 1983. [doi]

Existence of dominating cycles and pathsHenk Jan Veldman. DM, 43(2-3):281-296, 1983. [doi]

1981

Contraction theorems in Hamiltonian graph theoryCornelis Hoede, Henk Jan Veldman. DM, 34(1):61-67, 1981. [doi]

1978

On characterization of Hamiltonian graphsCornelis Hoede, Henk Jan Veldman. JCT, 25(1):47-53, 1978. [doi]

Sign in or sign up to see more results.

runs on WebDSL