Colin de Verdière's invariant is a graph parameter μ ( G ) {\displaystyle \mu (G)} for any graph G, introduced by Yves Colin de Verdière in 1990. It was...
10 KB (1,089 words) - 04:14, 25 September 2024
(including quantum chaos); in graph theory where he introduced a new graph invariant, the Colin de Verdière graph invariant; and on a variety of other subjects...
3 KB (197 words) - 03:47, 12 January 2023
In graph theory, a graph property or graph invariant is a property of graphs that depends only on the abstract structure, not on graph representations...
10 KB (1,182 words) - 09:40, 26 April 2025
Linkless embedding (redirect from Linklessly embeddable graph)
Colin de Verdière graph invariant is an integer defined for any graph using algebraic graph theory. The graphs with Colin de Verdière graph invariant...
29 KB (3,484 words) - 06:21, 9 January 2025
de Verdière graph invariant at most two or three, the linklessly embeddable graphs are the graphs that have Colin de Verdière invariant at most four...
35 KB (4,541 words) - 18:54, 9 May 2025
Colin de Verdière graph invariant is at most two. The graphs characterized in a similar way by having Colin de Verdière invariant at most one, three, or...
19 KB (2,089 words) - 08:10, 14 January 2025
is a graph parameter mr ( G ) {\displaystyle \operatorname {mr} (G)} for a graph G. It was motivated by the Colin de Verdière graph invariant. The adjacency...
4 KB (542 words) - 08:23, 9 December 2020
Linear forest (category Trees (graph theory))
graph.: 130, 131 An acyclic graph where every vertex has degree 0, 1, or 2 is a linear forest.: 310 : 107 An undirected graph has Colin de Verdière...
8 KB (837 words) - 06:44, 12 May 2025
associated to the graph, such as the Colin de Verdière number. Two graphs are called cospectral or isospectral if the adjacency matrices of the graphs are isospectral...
15 KB (1,844 words) - 20:28, 19 February 2025
-Moore graph.) every cubic bridgeless graph without Petersen minor has a cycle double cover. is the smallest cubic graph with Colin de Verdière graph invariant...
24 KB (2,993 words) - 04:57, 12 April 2025
The Heawood graph is the smallest cubic graph with Colin de Verdière graph invariant μ = 6. The Heawood graph is a unit distance graph: it can be embedded...
10 KB (1,001 words) - 06:23, 6 March 2025
Heawood family (redirect from Heawood graphs)
of intrinsically knotted graphs, of graphs that are not 4-flat, and of graphs with Colin de Verdière graph invariant μ = 6 {\displaystyle \mu =6} . The...
5 KB (689 words) - 22:46, 26 November 2024
Robertson–Seymour theorem (redirect from Robertson-Seymour graph minor theorem)
bounded by some fixed constant; graphs with Colin de Verdière graph invariant bounded by some fixed constant; graphs with treewidth, pathwidth, or branchwidth...
21 KB (2,900 words) - 23:37, 6 May 2025
Boxicity (category Graph invariants)
In graph theory, boxicity is a graph invariant, introduced by Fred S. Roberts in 1969. The boxicity of a graph is the minimum dimension in which a given...
13 KB (1,554 words) - 10:46, 29 January 2025
Steinitz's theorem (category Geometric graph theory)
representations of graphs and matrices realizing the Colin de Verdière graph invariants of the same graphs. The Colin de Verdière invariant is the maximum...
50 KB (5,973 words) - 22:41, 27 February 2025
François Jaeger (mathematician) (category Graph theorists)
Geneva and from the Institut Fourier (Grenoble), in particular Yves Colin de Verdière. Jaeger was hired by the French National Centre for Scientific Research...
7 KB (659 words) - 13:08, 8 April 2025
Arithmetic Fuchsian group (category CS1 German-language sources (de))
connected components. The quantum ergodicity theorem of Shnirelman, Colin de Verdière and Zelditch states that on average, eigenfunctions equidistribute...
24 KB (3,844 words) - 17:56, 29 January 2024