A short proof of the planarity characterization of Colin de Verdière
From MaRDI portal
Publication:1907102
DOI10.1006/jctb.1995.1054zbMath0841.05025OpenAlexW1997066757MaRDI QIDQ1907102
Publication date: 22 February 1996
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1995.1054
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (14)
Discrete quantitative nodal theorem ⋮ Using a new zero forcing process to guarantee the strong Arnold property ⋮ Spectral representations of vertex transitive graphs, Archimedean solids and finite Coxeter groups ⋮ Symmetric matrices, signed graphs, and nodal domain theorems ⋮ Nodal domain theorems for \(p\)-Laplacians on signed graphs ⋮ Nullspace Embeddings for Outerplanar Graphs ⋮ The strong Arnold property for 4-connected flat graphs ⋮ A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs ⋮ On algebraic connectivity and spectral integral variations of graphs ⋮ Graphs and their real eigenvectors ⋮ The Colin de Verdière number and sphere representations of a graph ⋮ Multiplicities of eigenvalues and tree-width of graphs ⋮ On the null space of a Colin de Verdière matrix ⋮ Steinitz representations of polyhedra and the Colin de Verdière number
This page was built for publication: A short proof of the planarity characterization of Colin de Verdière
