Skip to search formSkip to main contentSkip to account menu

Colin de Verdière graph invariant

Known as: Colin de Verdiere invariant, Colin de Verdière's invariant, Colin de Verdière number 
Colin de Verdière's invariant is a graph parameter for any graph G, introduced by Yves Colin de Verdière in 1990. It was motivated by the study of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
CombinatoricaComplement graphCorankCrossing number (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Mammals and meaningful taxonomic units: the debate about species concepts and conservation
The species problem is still one of the most pressing issues in biology, and a consensual solution seems as far away as ever… 
Review
2012
Review
2012
Fighting against diffraction: apodization and near field diffraction structures
Diffraction is a natural phenomenon, which occurs when waves propagate or encounter an obstacle. Diffraction is also a… 
Highly Cited
2011
Highly Cited
2011
Along-Arc Variations in the Pre-Eruptive H2O Contents of Mariana Arc Magmas Inferred from Fractionation Paths
New experimental results are presented on the effects of dissolved H2O during low-pressure (52 kbar) crystal fractionation in… 
2010
2010
DNA sequences from three genomes reveal multiple long-distance dispersals and non-monophyly of sections in Australasian Plantago (Plantaginaceae)
We examined the geographic origins and taxonomic placements of New Zealand and Australian Plantago (Plantaginaceae) by using… 
Highly Cited
2007
Highly Cited
2007
Anatomy of the ADO.NET entity framework
Traditional client-server applications relegate query and persistence operations on their data to database systems. The database… 
Highly Cited
2007
Highly Cited
2007
Magnetohydrodynamic evolution of magnetic skeletons
The heating of the solar corona is probably due to reconnection of the highly complex magnetic field that threads throughout its… 
Highly Cited
2005
Highly Cited
2005
Deep lexical acquisition of verb-particle constructions
Highly Cited
1998
Highly Cited
1998
Efficient Timed Reachability Analysis using Clock Difference Diagrams
One of the major problems in applying automatic verication tools to industrial-size systems is the excessive amount of memory… 
Highly Cited
1997
Highly Cited
1997
The Colin de Verdière number and sphere representations of a graph
Colin de Vedière introduced an interesting linear algebraic invariant μ(G) of graphs. He proved that μ(G)≤2 if and only ifG is… 
1995
1995
A Short Proof of the Planarity Characterization of Colin de Verdière
  • Hein Vanderholst
  • Journal of combinatorial theory. Series B (Print)
  • 1995
  • Corpus ID: 41273926
Colin de Verdiere introduced an interesting new invariant ?(G) for graphs G, based on algebraic and analytic properties of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)