# Colin de Verdière graph invariant

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Electr. J. Comb.
- 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)

Is this relevant?

2016

2016

- Eur. J. Comb.
- 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

- 2010

Experimental evidence has consistently confirmed the ability of uninformed traders, even novices, to infer information from the… (More)

Is this relevant?

2009

2009

- 2009

The Colin de Verdière graph paramater essentially measures the maximum multiplicity of the second eigenvalue of a generalized… (More)

Is this relevant?

2008

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

- 2007

In 1990, Y. Colin de Verdière introduced a new graph parameter μ(G), based on spectral properties of matrices associated with G… (More)

Is this relevant?

2005

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

- J. Comb. Theory, Ser. B
- 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

- CAV
- 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

- Combinatorica
- 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?