default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 38 matches
- 2002
- 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) - 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
- Douglas Bauer, Hajo Broersma, Henk Jan Veldman:
Not Every 2-tough Graph Is Hamiltonian. Discret. Appl. Math. 99(1-3): 317-321 (2000) - 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) - Douglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman:
Long cycles in 3-cyclable graphs. Discret. Math. 218(1-3): 1-8 (2000) - 1999
- Huib Trommel, Henk Jan Veldman, A. Verschut:
Pancyclicity of claw-free hamiltonian graphs. Discret. Math. 197-198: 781-789 (1999) - 1997
- 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
- 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) - 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) - 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) - 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) - 1995
- Douglas Bauer, Haitze J. Broersma, Henk Jan Veldman:
On generalizing a theorem of Jung. Ars Comb. 40 (1995) - 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) - E. van Blanken, Jan van den Heuvel, Henk Jan Veldman:
Pancyclicity of hamiltonian line graphs. Discret. Math. 138(1-3): 379-385 (1995) - Henk Jan Veldman:
Dλ-cycles in 3-cyclable graphs. Graphs Comb. 11(4): 379-388 (1995) - 1994
- Henk Jan Veldman:
On dominating and spanning circuits in graphs. Discret. Math. 124(1-3): 229-239 (1994) - 1993
- 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) - 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) - 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) - 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) - 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
- Henk Jan Veldman:
Cycles containing many vertices of large degree. Discret. Math. 101(1-3): 319-325 (1992) - 1991
- Douglas Bauer, Genghua Fan, Henk Jan Veldman:
Hamiltonian properties of graphs with large neighborhood unions. Discret. Math. 96(1): 33-49 (1991) - F. Göbel, J. Orestes Cerdeira, Henk Jan Veldman:
Label-connected graphs and the gossip problem. Discret. Math. 87(1): 29-40 (1991) - 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
- 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) - 1989
- 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
- Henk Jan Veldman:
A result on Hamiltonian line graphs involving restrictions on induced subgraphs. J. Graph Theory 12(3): 413-420 (1988) - 1987
- 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) - Andries E. Brouwer, Henk Jan Veldman:
Contractibility and NP-completeness. J. Graph Theory 11(1): 71-79 (1987)
skipping 8 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-30 12:21 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint