Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
DOI10.1016/0095-8956(90)90093-FzbMATH Open0742.05061OpenAlexW2065805017MaRDI QIDQ1813331FDOQ1813331
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eigenfunctions and nodal sets
- Modes and quasimodes
- Sur la multiplicité de la premiere valeur propre des surfaces riemanniennes
- Sur la multiplicité de la première valeur propre non nulle du Laplacien. (On the multiplicity of the first nonzero eigenvalue of the Laplacian)
- Construction de laplaciens dont une partie finie du spectre est donnée
- Title not available (Why is that?)
- Graph minors. I. Excluding a forest
- Title not available (Why is that?)
- Sur la multiplicité de la première valeur propre d'une surface de Riemann à courbure constante. (On the multiplicity of the first eigenvalue of a Riemannian surface of constant curvature)
- Title not available (Why is that?)
- Sur une hypothèse de transversalité d'Arnold. (About a transversality hypothesis of Arnold)
- Title not available (Why is that?)
- A Dual form of Kuratowski's Theorem
Cited In (76)
- The complement of a nIL graph with thirteen vertices is IL
- The extremal function and Colin de Verdière graph parameter
- Nullspace Embeddings for Outerplanar Graphs
- On the null space of a Colin de Verdière matrix
- Covering planar graphs with forests, one having a bounded maximum degree
- Construction of matrices with a given graph and prescribed interlaced spectral data
- Linkless and flat embeddings in 3-space
- Steinitz representations of polyhedra and the Colin de Verdière number
- Optimizing Colin de Verdière matrices of \(K_{4,4}\)
- Book review of: L. Lovász, Graphs and geometry
- Graph embeddings and Schrödinger equation
- The minimum semidefinite rank of the complement of partial \(k\)-trees
- A reduction procedure for the Colin de Verdière number of a graph
- Three-connected graphs whose maximum nullity is at most three
- Laplacian matrices of graphs: A survey
- On Euclidean distances and sphere representations
- Knots and links in spatial graphs: a survey
- Geometric representations of graphs
- Star partitions and the graph isomorphism problem
- Title not available (Why is that?)
- Graphs with magnetic Schrödinger operators of low corank
- The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
- Tree densities in sparse graph classes
- The strong spectral property for graphs
- The strong Arnold property for 4-connected flat graphs
- Selected Open Problems in Discrete Geometry and Optimization
- Some recent progress and applications in graph minor theory
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- Approximating the minimum rank of a graph via alternating projection
- On the number of edges in maximally linkless graphs
- Parabolic theory of the discrete \(p\)-Laplace operator
- Covering planar graphs with forests, one having bounded maximum degree
- Graph Laplacians, nodal domains, and hyperplane arrangements
- Graph coloring and semidefinite rank
- The Colin de Verdière number and sphere representations of a graph
- Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph
- On embeddability and stresses of graphs
- Multiplicities of eigenvalues and tree-width of graphs
- Hadwiger numbers of self-complementary graphs
- On Vertex Partitions and the Colin de Verdière Parameter
- On the Colin de Verdière numbers of Cartesian graph products
- Geometric representations of graphs
- Phase transition of degeneracy in minor-closed families
- On the invariance of Colin de Verdière's graph parameter under clique sums
- Boxicity and topological invariants
- A minor-monotone graph parameter based on oriented matroids
- The Colin de Verdière parameter, excluded minors, and the spectral radius
- Graphs and obstructions in four dimensions.
- Universal completability, least eigenvalue frameworks, and vector colorings
- Title not available (Why is that?)
- The inertia set of a signed graph
- A Complexity Dichotomy for the Coloring of Sparse Graphs
- Global rigidity of triangulations with braces
- Multiplicités des valeurs propres et transformations étoile-triangle des graphes
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
- On the Colin de Verdière number of graphs
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
- On vertex partitions and some minor-monotone graph parameters
- Exotic eigenvalues of shrinking metric graphs
- The strong spectral property of graphs: graph operations and barbell partitions
- A linear bound for the Colin de Verdière parameter \(\mu\) for graphs embedded on surfaces
- Local degree conditions for \({K}_9\)-minors in graphs
- The liberation set in the inverse eigenvalue problem of a graph
- The inverse nullity pair problem and the strong nullity interlacing property
- Coxeter groups, hyperbolic cubes and acute triangulations
- Graph coloring and semidefinite rank
- Symplectic geometry, minors and graph Laplacians
- Eigenpolytope Universality and Graphical Designs
- On the Colin de Verdière graph number and penny graphs
- The complement problem for linklessly embeddable graphs
- Approximate realizations for outerplanaric degree sequences
- Improved bounds on the cop number when forbidding a minor
- Super stable tensegrities and the Colin de Verdière number \(\nu\)
- Minimum Degree and Graph Minors
- Title not available (Why is that?)
- Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant
This page was built for publication: Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813331)