Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)

From MaRDI portal
Publication:1813331

DOI10.1016/0095-8956(90)90093-FzbMath0742.05061OpenAlexW2065805017MaRDI QIDQ1813331

Yves Colin de Verdière

Publication date: 25 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90093-f




Related Items

Tree densities in sparse graph classesGraph Laplacians, nodal domains, and hyperplane arrangementsThe complement problem for linklessly embeddable graphsBook review of: L. Lovász, Graphs and geometryThe bifurcation lemma for strong properties in the inverse eigenvalue problem of a graphMinimum Degree and Graph MinorsCovering planar graphs with forests, one having a bounded maximum degreeSymplectic geometry, minors and graph LaplaciansThe inertia set of a signed graphOn the invariance of Colin de Verdière's graph parameter under clique sumsA minor-monotone graph parameter based on oriented matroidsGraph coloring and semidefinite rankThe strong spectral property for graphsSome recent progress and applications in graph minor theoryHadwiger numbers of self-complementary graphsUniversal completability, least eigenvalue frameworks, and vector coloringsUnnamed ItemOptimizing Colin de Verdière matrices of \(K_{4,4}\)Construction of matrices with a given graph and prescribed interlaced spectral dataRNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical propertiesParabolic theory of the discrete \(p\)-Laplace operatorOn the number of edges in maximally linkless graphsStar partitions and the graph isomorphism problemGlobal rigidity of triangulations with bracesConstructions stemming from nonseparating planar graphs and their Colin de Verdière invariantExotic eigenvalues of shrinking metric graphsThe minimum semidefinite rank of the complement of partial \(k\)-treesThe strong spectral property of graphs: graph operations and barbell partitionsLinkless and flat embeddings in 3-spaceThe liberation set in the inverse eigenvalue problem of a graphOn the Colin de Verdière number of graphsPhase transition of degeneracy in minor-closed familiesEigenpolytope Universality and Graphical DesignsNullspace Embeddings for Outerplanar GraphsSphere representations, stacked polytopes, and the Colin de Verdière number of a graphMultiplicités des valeurs propres et transformations étoile-triangle des graphesOn Euclidean distances and sphere representationsPositive semidefinite matrix completion, universal rigidity and the strong Arnold propertyThree-connected graphs whose maximum nullity is at most threeBoxicity and topological invariantsThe complement of a nIL graph with thirteen vertices is ILOn embeddability and stresses of graphsThe strong Arnold property for 4-connected flat graphsA Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphsThe extremal function and Colin de Verdière graph parameterThe Colin de Verdière parameter, excluded minors, and the spectral radiusA Complexity Dichotomy for the Coloring of Sparse GraphsUnnamed ItemGraph embeddings and Schrödinger equationGraphs and obstructions in four dimensions.Approximating the minimum rank of a graph via alternating projectionCoxeter groups, hyperbolic cubes and acute triangulationsOn vertex partitions and some minor-monotone graph parametersCovering planar graphs with forests, one having bounded maximum degreeA reduction procedure for the Colin de Verdière number of a graphThe Colin de Verdière number and sphere representations of a graphMultiplicities of eigenvalues and tree-width of graphsOn the Colin de Verdière numbers of Cartesian graph productsGeometric representations of graphsOn the null space of a Colin de Verdière matrixSelected Open Problems in Discrete Geometry and OptimizationKnots and links in spatial graphs: a surveySteinitz representations of polyhedra and the Colin de Verdière numberGraphs with magnetic Schrödinger operators of low corankGeometric representations of graphsOn Vertex Partitions and the Colin de Verdière ParameterLaplacian matrices of graphs: A survey



Cites Work