On the Colin de Verdière number of graphs
From MaRDI portal
Publication:630509
DOI10.1016/j.laa.2010.05.008zbMath1221.05259OpenAlexW2087946336MaRDI QIDQ630509
Abraham Berman, Felix Goldberg
Publication date: 17 March 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.05.008
Related Items (5)
Tree densities in sparse graph classes ⋮ Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph ⋮ Boxicity and topological invariants ⋮ The Colin de Verdière number and joins of graphs ⋮ A reduction procedure for the Colin de Verdière number of a graph
Cites Work
- On rigid circuit graphs
- Simplicial decompositions of graphs: A survey of applications
- Multiplicities of eigenvalues and tree-width of graphs
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- Sachs' linkless embedding conjecture
- On the invariance of Colin de Verdière's graph parameter under clique sums
- Determination of the inertia of a partitioned Hermitian matrix
- Graph Classes: A Survey
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
- Tree-width and circumference of graphs
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the Colin de Verdière number of graphs
