default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenk Jan Veldman
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j38]J. Adrian Bondy, Hajo Broersma
, Jan van den Heuvel, Henk Jan Veldman:
Heavy cycles in weighted graphs. Discuss. Math. Graph Theory 22(1): 7-15 (2002)- [j37]Hajo Broersma, Ralph J. Faudree, Andreas Huck, Huib Trommel, Henk Jan Veldman:
Forbidden subgraphs that imply hamiltonian-connectedness. J. Graph Theory 40(2): 104-119 (2002) - 2000
- [j36]Douglas Bauer, Hajo Broersma, Henk Jan Veldman:
Not Every 2-tough Graph Is Hamiltonian. Discret. Appl. Math. 99(1-3): 317-321 (2000) - [j35]Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman:
Chordality and 2-factors in Tough Graphs. Discret. Appl. Math. 99(1-3): 323-329 (2000) - [j34]Douglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman:
Long cycles in 3-cyclable graphs. Discret. Math. 218(1-3): 1-8 (2000)
1990 – 1999
- 1999
- [j33]Huib Trommel, Henk Jan Veldman, A. Verschut:
Pancyclicity of claw-free hamiltonian graphs. Discret. Math. 197-198: 781-789 (1999) - 1997
- [j32]Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman:
Cycles through subsets with large degree sums. Discret. Math. 171(1-3): 43-54 (1997) - 1996
- [j31]Douglas Bauer, Edward F. Schmeichel, Henk Jan Veldman:
A note on dominating cycles in 2-connected graphs. Discret. Math. 155(1-3): 13-18 (1996) - [j30]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): 1-10 (1996) - [j29]Haitze J. Broersma, Jan van den Heuvel, Bill Jackson, Henk Jan Veldman:
Hamiltonicity of regular 2-connected graphs. J. Graph Theory 22(2): 105-124 (1996) - [j28]Thomas Böhme, Haitze J. Broersma, Henk Jan Veldman:
Toughness and longest cycles in 2-connected planar graphs. J. Graph Theory 23(3): 257-263 (1996) - 1995
- [j27]Douglas Bauer, Haitze J. Broersma, Henk Jan Veldman:
On generalizing a theorem of Jung. Ars Comb. 40 (1995) - [j26]E. van Blanken, Jan van den Heuvel, Henk Jan Veldman:
Pancyclicity of hamiltonian line graphs. Discret. Math. 138(1-3): 379-385 (1995) - [j25]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): 1-10 (1995) - [j24]Henk Jan Veldman:
Dλ-cycles in 3-cyclable graphs. Graphs Comb. 11(4): 379-388 (1995) - 1994
- [j23]Henk Jan Veldman:
On dominating and spanning circuits in graphs. Discret. Math. 124(1-3): 229-239 (1994) - 1993
- [j22]Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman:
Long cycles, degree sums and neighborhood unions. Discret. Math. 121(1-3): 25-35 (1993) - [j21]Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman:
A generalization of Ore's Theorem involving neighborhood unions. Discret. Math. 122(1-3): 37-49 (1993) - [j20]Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman:
Long paths and cycles in tough graphs. Graphs Comb. 9(1): 3-17 (1993) - [j19]Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman:
Cycles containing all vertices of maximum degree. J. Graph Theory 17(3): 373-385 (1993) - [j18]Haitze J. Broersma, Ralph J. Faudree, Jan van den Heuvel, Henk Jan Veldman:
Decomposition of bipartite graphs under degree constraints. Networks 23(3): 159-164 (1993) - 1992
- [j17]Henk Jan Veldman:
Cycles containing many vertices of large degree. Discret. Math. 101(1-3): 319-325 (1992) - 1991
- [j16]F. Göbel, J. Orestes Cerdeira, Henk Jan Veldman:
Label-connected graphs and the gossip problem. Discret. Math. 87(1): 29-40 (1991) - [j15]Douglas Bauer, Genghua Fan, Henk Jan Veldman:
Hamiltonian properties of graphs with large neighborhood unions. Discret. Math. 96(1): 33-49 (1991) - [j14]Haitze J. Broersma, Henk Jan Veldman:
Long dominating cycles and paths in graphs with large neighborhood unions. J. Graph Theory 15(1): 29-38 (1991) - 1990
- [j13]Douglas Bauer, Henk Jan Veldman, Aurora Morgana, Edward F. Schmeichel:
Long cycles in graphs with large degree sums. Discret. Math. 79(1): 59-70 (1990)
1980 – 1989
- 1989
- [j12]Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao:
A generalization of a result of Häggkvist and Nicoghossian. J. Comb. Theory B 47(2): 237-243 (1989) - 1988
- [j11]Henk Jan Veldman:
A result on Hamiltonian line graphs involving restrictions on induced subgraphs. J. Graph Theory 12(3): 413-420 (1988) - 1987
- [j10]Andries E. Brouwer, Henk Jan Veldman:
Contractibility and NP-completeness. J. Graph Theory 11(1): 71-79 (1987) - [j9]Haitze J. Broersma, Henk Jan Veldman:
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian. J. Graph Theory 11(3): 399-407 (1987) - 1986
- [j8]F. Göbel, Henk Jan Veldman:
Even graphs. J. Graph Theory 10(2): 225-239 (1986) - [j7]Abdelhamid Benhocine, L. Clark, N. Köhler, Henk Jan Veldman:
On circuits and pancyclic line graphs. J. Graph Theory 10(3): 411-425 (1986) - 1984
- [j6]H. J. Krol, Henk Jan Veldman:
On maximum critically h-connected graphs. Discret. Math. 52(2-3): 225-234 (1984) - 1983
- [j5]Henk Jan Veldman:
Existence of dominating cycles and paths. Discret. Math. 43(2-3): 281-296 (1983) - [j4]Henk Jan Veldman:
Non-kappa-critical vertices in graphs. Discret. Math. 44(1): 105-110 (1983) - [j3]Henk Jan Veldman:
Existence of Dlambda-cycles and Dlambda-paths. Discret. Math. 44(3): 309-316 (1983) - 1981
- [j2]Cornelis Hoede, Henk Jan Veldman:
Contraction theorems in Hamiltonian graph theory. Discret. Math. 34(1): 61-67 (1981)
1970 – 1979
- 1978
- [j1]Cornelis Hoede, Henk Jan Veldman:
On characterization of Hamiltonian graphs. J. Comb. Theory B 25(1): 47-53 (1978)
Coauthor Index
aka: Haitze J. Broersma
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
