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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We prove that a k-tree can be viewed as a subgraph of a special type of (k+ 1)tree that corresponds to a stacked polytope and… (More)
  • figure 1
  • figure 2
Is this relevant?
2016
2016
The boxicity of a graph G = (V,E) is the smallest integer k for which there exist k interval graphs Gi = (V,Ei), 1 ≤ i ≤ k, such… (More)
Is this relevant?
2010
2010
Experimental evidence has consistently confirmed the ability of uninformed traders, even novices, to infer information from the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
The Colin de Verdière graph paramater essentially measures the maximum multiplicity of the second eigenvalue of a generalized… (More)
  • figure 26.1
  • figure 26.2
  • figure 26.3
Is this relevant?
2008
2008
The Colin de Verdière number μ(G) of a graph G is the maximum corank of a Colin de Verdière matrix for G (that is, of a Schr… (More)
Is this relevant?
Review
2007
Review
2007
In 1990, Y. Colin de Verdière introduced a new graph parameter μ(G), based on spectral properties of matrices associated with G… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
We show that the Steinitz representations of 3-connected planar graphs are correspond, in a well described way, to Colin de Verdi… (More)
Is this relevant?
2001
2001
We show that the Steinitz representations of 3-connected planar graphs are correspond, in a well described way, to Colin de Verdi… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
One of the major problems in applying automatic verification tools to industrial-size systems is the excessive amount of memory… (More)
Is this relevant?
1997
1997
Colin de Verdi ere introduced an interesting linear algebraic invariant (G) of graphs. He proved that (G) 2 if and only if G is… (More)
Is this relevant?