The Colin de Verdière number and joins of graphs

DOI10.1007/s00454-020-00197-wzbMath1462.05237OpenAlexW3019349693MaRDI QIDQ2022616

Lon H. Mitchell

Publication date: 29 April 2021

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-020-00197-w

zbMATH Keywords

chromatic numberColin de Verdière numbergraph complement conjecturejoins of graphsedge extremal function

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Coloring of graphs and hypergraphs (05C15) Vector spaces, linear dependence, rank, lineability (15A03) Circle packings and discrete conformal geometry (52C26) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• On the graph complement conjecture for minimum rank
• On the Colin de Verdière number of graphs
• On the minimum rank of the join of graphs and decomposable graphs
• Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph
• The Colin de Verdière number and sphere representations of a graph
• The extremal function and Colin de Verdière graph parameter
• Nordhaus-Gaddum problems for Colin de Verdière type parameters, variants of tree-width, and related parameters
• Matrix Analysis

This page was built for publication: The Colin de Verdière number and joins of graphs