Hein van der Holst

According to our database, Hein van der Holst authored at least 13 papers between 2002 and 2023.

Collaborative distances:

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

2023

On 2-cycles of graphs.

Sergey Norin, Robin Thomas, Hein van der Holst

J. Comb. Theory, Ser. B, 2023

2019

Extremal Union-Closed Set Families.

Guantao Chen, Hein van der Holst, Alexandr V. Kostochka, Nana Li

Graphs Comb., 2019

2016

Signed graphs whose signed Colin de Verdière parameter is two.

Marina Arav, Frank J. Hall, Zhongshan Li, Hein van der Holst

J. Comb. Theory, Ser. B, 2016

2013

Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a Graph.

Francesco Barioli, Wayne Barrett, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, Bryan L. Shader, Pauline van den Driessche, Hein van der Holst

J. Graph Theory, 2013

2009

A polynomial-time algorithm to find a linkless embedding of a graph.

Hein van der Holst

J. Comb. Theory, Ser. B, 2009

On a graph property generalizing planarity and flatness.

Hein van der Holst, Rudi Pendavingh

Comb., 2009

2007

Algebraic characterizations of outerplanar and planar graphs.

Hein van der Holst

Eur. J. Comb., 2007

2006

Graphs and obstructions in four dimensions.

Hein van der Holst

J. Comb. Theory, Ser. B, 2006

2003

Some connectivity properties for excluded minors of the graph invariant V (G).

Hein van der Holst

Eur. J. Comb., 2003

Two Tree-Width-Like Graph Invariants.

Hein van der Holst

Comb., 2003

2002

On the "largeur d'arborescence".

Hein van der Holst

J. Graph Theory, 2002

Graphs with Magnetic Schrödinger Operators of Low Corank.

Hein van der Holst

J. Comb. Theory, Ser. B, 2002

Length-bounded disjoint paths in planar graphs.

Hein van der Holst, José Coelho de Pina

Discret. Appl. Math., 2002