The following pages link to Hein van der Holst (Q417527):
Displaying 49 items.
- On the graph complement conjecture for minimum rank (Q417528) (← links)
- On the inertia set of a signed tree with loops (Q501253) (← links)
- The minimum semidefinite rank of the complement of partial \(k\)-trees (Q627949) (← links)
- The inertia set of the join of graphs (Q632470) (← links)
- Two tree-width-like graph invariants (Q705708) (← links)
- The inertia sets of graphs with a 2-separation (Q744118) (← links)
- Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\) (Q876301) (← links)
- Signed graphs whose signed Colin de Verdière parameter is two (Q896009) (← links)
- Three-connected graphs whose maximum nullity is at most three (Q929488) (← links)
- Zero forcing parameters and minimum rank problems (Q975607) (← links)
- A polynomial-time algorithm to find a linkless embedding of a graph (Q1003855) (← links)
- Some connectivity properties for excluded minors of the graph invariant \(\nu(G)\) (Q1413238) (← links)
- Graphs whose positive semi-definite matrices have nullity at most two (Q1414690) (← links)
- Interlace polynomials (Q1418963) (← links)
- (Q1613378) (redirect page) (← links)
- Length-bounded disjoint paths in planar graphs (Q1613380) (← links)
- Graphs with magnetic Schrödinger operators of low corank (Q1850594) (← links)
- On the invariance of Colin de Verdière's graph parameter under clique sums (Q1899429) (← links)
- A short proof of the planarity characterization of Colin de Verdière (Q1907102) (← links)
- On a minor-monotone graph invariant (Q1907104) (← links)
- Signed graphs with stable maximum nullity at most two (Q2020682) (← links)
- Two-connected signed graphs with maximum nullity at most two (Q2228486) (← links)
- On the inertia set of a signed graph with loops (Q2261536) (← links)
- Extremal union-closed set families (Q2287742) (← links)
- The inverse inertia problem for the complements of partial \(k\)-trees (Q2435477) (← links)
- The minimum rank of a sign pattern matrix with a 1-separation (Q2442438) (← links)
- Algebraic characterizations of outerplanar and planar graphs (Q2461772) (← links)
- The maximum corank of graphs with a 2-separation (Q2477537) (← links)
- Zero forcing sets and the minimum rank of graphs (Q2477541) (← links)
- Graphs and obstructions in four dimensions. (Q2490839) (← links)
- The inertia set of a signed graph (Q2637138) (← links)
- Sign patterns with minimum rank 2 and upper bounds on minimum ranks (Q2850984) (← links)
- On the Strong Arnol'd Hypothesis and the connectivity of graphs (Q3075166) (← links)
- On the ?largeur d'arborescence? (Q3150174) (← links)
- On the maximum positive semi-definite nullity and the cycle matroid of graphs (Q3394468) (← links)
- Generating potentially nilpotent full sign patterns (Q3394470) (← links)
- On the minimum rank of not necessarily symmetric matrices: A preliminary study (Q3394472) (← links)
- Minimum ranks of sign patterns via sign vectors and duality (Q3448196) (← links)
- The Colin de Verdière graph parameter (Q4250144) (← links)
- (Q4343705) (← links)
- Graphs whose minimal rank is two (Q4656572) (← links)
- Graphs whose minimal rank is two: The finite fields case (Q4656586) (← links)
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← links)
- A matching-minor monotone parameter for bipartite graphs (Q6087877) (← links)
- Signed graphs with maximum nullity two (Q6168544) (← links)
- On 2-cycles of graphs (Q6170796) (← links)
- Sparsity of graphs that allow two distinct eigenvalues (Q6173926) (← links)
- The inverse eigenvalue problem for probe graphs (Q6523899) (← links)
- The stable maximum nullity of digraphs and $1$-DAGs (Q6749014) (← links)
