Hein van der Holst - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2023

On 2-cycles of graphsSergey Norin, Robin Thomas 0001, Hein van der Holst. jctb, 162:184-222, 2023. [doi]

2019

Extremal Union-Closed Set FamiliesGuantao Chen, Hein van der Holst, Alexandr Kostochka, Nana Li. gc, 35(6):1495-1502, 2019. [doi]

2016

Signed graphs whose signed Colin de Verdière parameter is twoMarina Arav, Frank J. Hall, Zhongshan Li, Hein van der Holst. JCT, 116:440-455, 2016. [doi]

2013

Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a GraphFrancesco Barioli, Wayne Barrett, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, Bryan L. Shader, Pauline van den Driessche, Hein van der Holst. jgt, 72(2):146-177, 2013. [doi]

2009

On a graph property generalizing planarity and flatnessHein van der Holst, Rudi Pendavingh. combinatorica, 29(3):337-361, 2009. [doi]

A polynomial-time algorithm to find a linkless embedding of a graphHein van der Holst. JCT, 99(2):512-530, 2009. [doi]

2007

Algebraic characterizations of outerplanar and planar graphsHein van der Holst. ejc, 28(8):2156-2166, 2007. [doi]

2006

Graphs and obstructions in four dimensionsHein van der Holst. JCT, 96(3):388-404, 2006. [doi]

2003

Some connectivity properties for excluded minors of the graph invariant V (G)Hein van der Holst. ejc, 24(7):929-946, 2003. [doi]

2002

Graphs with Magnetic Schrödinger Operators of Low CorankHein van der Holst. JCT, 84(2):311-339, 2002. [doi]

Length-bounded disjoint paths in planar graphsHein van der Holst, José Coelho de Pina. DAM, 120(1-3):251-261, 2002.

On the "largeur d'arborescence"Hein van der Holst. jgt, 41(1):24-52, 2002. [doi]

Sign in or sign up to see more results.

runs on WebDSL