![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Hein van der Holst
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j13]Sergey Norin, Robin Thomas, Hein van der Holst:
On 2-cycles of graphs. J. Comb. Theory B 162: 184-222 (2023)
2010 – 2019
- 2019
- [j12]Guantao Chen, Hein van der Holst, Alexandr V. Kostochka, Nana Li:
Extremal Union-Closed Set Families. Graphs Comb. 35(6): 1495-1502 (2019) - 2016
- [j11]Marina Arav, Frank J. Hall, Zhongshan Li
, Hein van der Holst
:
Signed graphs whose signed Colin de Verdière parameter is two. J. Comb. Theory B 116: 440-455 (2016) - 2013
- [j10]Francesco Barioli, Wayne Barrett, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, Bryan L. Shader
, Pauline van den Driessche, Hein van der Holst
:
Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a Graph. J. Graph Theory 72(2): 146-177 (2013)
2000 – 2009
- 2009
- [j9]Hein van der Holst
, Rudi Pendavingh:
On a graph property generalizing planarity and flatness. Comb. 29(3): 337-361 (2009) - [j8]Hein van der Holst
:
A polynomial-time algorithm to find a linkless embedding of a graph. J. Comb. Theory B 99(2): 512-530 (2009) - 2007
- [j7]Hein van der Holst
:
Algebraic characterizations of outerplanar and planar graphs. Eur. J. Comb. 28(8): 2156-2166 (2007) - 2006
- [j6]Hein van der Holst
:
Graphs and obstructions in four dimensions. J. Comb. Theory B 96(3): 388-404 (2006) - 2003
- [j5]Hein van der Holst
:
Two Tree-Width-Like Graph Invariants. Comb. 23(4): 633-651 (2003) - [j4]Hein van der Holst
:
Some connectivity properties for excluded minors of the graph invariant V (G). Eur. J. Comb. 24(7): 929-946 (2003) - 2002
- [j3]Hein van der Holst, José Coelho de Pina:
Length-bounded disjoint paths in planar graphs. Discret. Appl. Math. 120(1-3): 251-261 (2002) - [j2]Hein van der Holst
:
Graphs with Magnetic Schrödinger Operators of Low Corank. J. Comb. Theory B 84(2): 311-339 (2002) - [j1]Hein van der Holst
:
On the "largeur d'arborescence". J. Graph Theory 41(1): 24-52 (2002)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint