Hein van der Holst

From MaRDI portal
Person:417527

Available identifiers

zbMath Open van-der-holst.heinMaRDI QIDQ417527

List of research outcomes





PublicationDate of PublicationType
A matching-minor monotone parameter for bipartite graphs2023-11-16Paper
On 2-cycles of graphs2023-08-10Paper
Signed graphs with maximum nullity two2023-08-09Paper
Sparsity of graphs that allow two distinct eigenvalues2023-07-13Paper
Signed graphs with stable maximum nullity at most two2021-04-24Paper
Two-connected signed graphs with maximum nullity at most two2021-02-17Paper
Extremal union-closed set families2020-01-21Paper
On the Space of 2-Linkages2017-12-11Paper
On the inertia set of a signed tree with loops2016-12-29Paper
Signed graphs whose signed Colin de Verdière parameter is two2015-12-11Paper
Minimum ranks of sign patterns via sign vectors and duality2015-10-23Paper
On the inertia set of a signed graph with loops2015-03-06Paper
The inertia sets of graphs with a 2-separation2014-10-06Paper
The minimum rank of a sign pattern matrix with a 1-separation2014-04-03Paper
The inertia set of a signed graph2014-02-19Paper
The inverse inertia problem for the complements of partial \(k\)-trees2014-02-19Paper
Sign patterns with minimum rank 2 and upper bounds on minimum ranks2013-10-01Paper
Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph2013-03-07Paper
On the graph complement conjecture for minimum rank2012-05-14Paper
The inertia set of the join of graphs2011-03-25Paper
The minimum semidefinite rank of the complement of partial \(k\)-trees2011-03-04Paper
On the Strong Arnol'd Hypothesis and the connectivity of graphs2011-02-10Paper
Zero forcing parameters and minimum rank problems2010-06-10Paper
Generating potentially nilpotent full sign patterns2009-09-07Paper
On the maximum positive semi-definite nullity and the cycle matroid of graphs2009-09-07Paper
On the minimum rank of not necessarily symmetric matrices: A preliminary study2009-09-07Paper
A polynomial-time algorithm to find a linkless embedding of a graph2009-03-04Paper
Three-connected graphs whose maximum nullity is at most three2008-06-17Paper
Zero forcing sets and the minimum rank of graphs2008-03-14Paper
The maximum corank of graphs with a 2-separation2008-03-14Paper
Algebraic characterizations of outerplanar and planar graphs2007-11-21Paper
Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)2007-04-18Paper
Graphs and obstructions in four dimensions.2006-05-18Paper
Graphs whose minimal rank is two2005-03-11Paper
Graphs whose minimal rank is two: The finite fields case2005-03-11Paper
Two tree-width-like graph invariants2005-02-14Paper
Interlace polynomials2004-01-14Paper
Graphs whose positive semi-definite matrices have nullity at most two2003-12-04Paper
Some connectivity properties for excluded minors of the graph invariant \(\nu(G)\)2003-11-16Paper
Graphs with magnetic Schrödinger operators of low corank2002-12-10Paper
On the ?largeur d'arborescence?2002-09-29Paper
Length-bounded disjoint paths in planar graphs2002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q42501442000-02-09Paper
https://portal.mardi4nfdi.de/entity/Q43437051997-07-06Paper
On a minor-monotone graph invariant1996-06-05Paper
On the invariance of Colin de Verdière's graph parameter under clique sums1996-03-31Paper
A short proof of the planarity characterization of Colin de Verdière1996-02-22Paper
The inverse eigenvalue problem for probe graphsN/APaper

Research outcomes over time

This page was built for person: Hein van der Holst