The following pages link to (Q4250144):
Displaying 47 items.
- Optimizing Colin de Verdière matrices of \(K_{4,4}\) (Q389679) (← links)
- On the graph complement conjecture for minimum rank (Q417528) (← links)
- Computing inertia sets using atoms (Q417545) (← links)
- The strong Arnold property for 4-connected flat graphs (Q518116) (← links)
- The Colin de Verdière number and graphs of polytopes (Q607842) (← links)
- On the Colin de Verdière number of graphs (Q630509) (← links)
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian (Q662288) (← links)
- Discrete quantitative nodal theorem (Q820852) (← links)
- Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\) (Q876301) (← links)
- Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph (Q907257) (← links)
- Techniques for determining the minimum rank of a small graph (Q967515) (← links)
- Expected values of parameters associated with the minimum rank of a graph (Q972786) (← links)
- The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
- On the Colin de Verdière numbers of Cartesian graph products (Q1039738) (← links)
- A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph (Q1715848) (← links)
- The extremal function and Colin de Verdière graph parameter (Q1753124) (← links)
- Approximating the minimum rank of a graph via alternating projection (Q1785758) (← links)
- Steinitz representations of polyhedra and the Colin de Verdière number (Q1850544) (← links)
- The inverse eigenvalue problem of a graph: multiplicities and minors (Q1985452) (← links)
- Sign patterns of orthogonal matrices and the strong inner product property (Q1987018) (← links)
- The Colin de Verdière parameter, excluded minors, and the spectral radius (Q2000642) (← links)
- The Colin de Verdière number and joins of graphs (Q2022616) (← links)
- Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees (Q2057597) (← links)
- An infinite family of linklessly embeddable Tutte-4-connected graphs (Q2141339) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- Graph coloring and semidefinite rank (Q2164723) (← links)
- A reduction procedure for the Colin de Verdière number of a graph (Q2309677) (← links)
- Existence of a not necessarily symmetric matrix with given distinct eigenvalues and graph (Q2359555) (← links)
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph (Q2363102) (← links)
- Global rigidity of triangulations with braces (Q2421558) (← links)
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property (Q2451678) (← links)
- Graphs and obstructions in four dimensions. (Q2490839) (← links)
- Phase transition of degeneracy in minor-closed families (Q2689167) (← links)
- On vertex partitions and some minor-monotone graph parameters (Q3067061) (← links)
- On Vertex Partitions and the Colin de Verdière Parameter (Q3439630) (← links)
- Gershgorin Disks for Multiple Eigenvalues of Non-negative Matrices (Q4604372) (← links)
- Nullspace Embeddings for Outerplanar Graphs (Q4604390) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- (Q5855594) (← links)
- On the number of edges in maximally linkless graphs (Q6056749) (← links)
- Multiplicity of the second‐largest eigenvalue of a planar graph (Q6056753) (← links)
- Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant (Q6122324) (← links)
- New bounds on maximal linkless graphs (Q6148480) (← links)
- Embedding and the rotational dimension of a graph containing a clique (Q6174141) (← links)
- Eigenpolytope Universality and Graphical Designs (Q6195955) (← links)
- Orthogonal realizations of random sign patterns and other applications of the SIPP (Q6202057) (← links)
- Capturing polytopal symmetries by coloring the edge-graph (Q6204769) (← links)
