On the invariance of Colin de Verdière's graph parameter under clique sums

DOI10.1016/0024-3795(95)00160-SzbMath0834.05036OpenAlexW2101503819MaRDI QIDQ1899429

Hein van der Holst, László Lovász, Alexander Schrijver

Publication date: 31 March 1996

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(95)00160-s

zbMATH Keywords

graph invariantclique sums

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

On the Colin de Verdière number of graphs ⋮ A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs ⋮ The extremal function and Colin de Verdière graph parameter ⋮ A Complexity Dichotomy for the Coloring of Sparse Graphs ⋮ Covering planar graphs with forests, one having bounded maximum degree ⋮ A reduction procedure for the Colin de Verdière number of a graph ⋮ On the null space of a Colin de Verdière matrix ⋮ Graphs with magnetic Schrödinger operators of low corank

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• Inertia characteristics of self-adjoint matrix polynomials
• 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 a minor-monotone graph invariant
• Multiplicités des valeurs propres et transformations étoile-triangle des graphes