Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article; zbMATH DE number 475583 - MaRDI portal

scientific article; zbMATH DE number 475583

From MaRDI portal
Publication:4273839

zbMath0791.05024MaRDI QIDQ4273839

Yves Colin de Verdière

Publication date: 8 June 1994


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (38)

Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graphTree densities in sparse graph classesUsing a new zero forcing process to guarantee the strong Arnold propertyThe bifurcation lemma for strong properties in the inverse eigenvalue problem of a graphThe inertia set of a signed graphOn the invariance of Colin de Verdière's graph parameter under clique sumsUnnamed ItemA minor-monotone graph parameter based on oriented matroidsThe strong spectral property for graphsForbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)Spectral representations of vertex transitive graphs, Archimedean solids and finite Coxeter groupsSome recent progress and applications in graph minor theoryOptimizing Colin de Verdière matrices of \(K_{4,4}\)Global rigidity of triangulations with bracesSigned graphs whose signed Colin de Verdière parameter is twoOn the graph complement conjecture for minimum rankThe 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 graphsSome connectivity properties for excluded minors of the graph invariant \(\nu(G)\)Three-connected graphs whose maximum nullity is at most threeA Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphsThe extremal function and Colin de Verdière graph parameterTechniques for determining the minimum rank of a small graphExpected values of parameters associated with the minimum rank of a graphGraphs and obstructions in four dimensions.Some arithmetical restatements of the four color conjectureThe minimum rank of symmetric matrices described by a graph: a surveyOn vertex partitions and some minor-monotone graph parametersThe Colin de Verdière number and sphere representations of a graphMultiplicities of eigenvalues and tree-width of graphsUnnamed ItemSome probabilistic restatements of the Four Color ConjectureOn the Colin de Verdière numbers of Cartesian graph productsKnots and links in spatial graphs: a surveyGraphs with magnetic Schrödinger operators of low corank




This page was built for publication: