The extremal function and Colin de Verdière graph parameter
From MaRDI portal
Publication:1753124
zbMath1391.05140arXiv1706.07451MaRDI QIDQ1753124
Publication date: 25 May 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.07451
graph theoryplanar graphschordal graphsextremal functionextremal graph theorygraph minorsgraph parametersColin de Verdière parametergraph complements
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the graph complement conjecture for minimum rank
- Lower bound of the Hadwiger number of graphs by their average degree
- Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph
- Three-connected graphs whose maximum nullity is at most three
- On embeddability and stresses of graphs
- Expected values of parameters associated with the minimum rank of a graph
- Hadwiger's conjecture is true for almost every graph
- The Colin de Verdière number and sphere representations of a graph
- On the relation between two minor-monotone graph parameters
- The four-colour theorem
- The extremal functions for triangle-free graphs with excluded minors
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- Sachs' linkless embedding conjecture
- On the invariance of Colin de Verdière's graph parameter under clique sums
- Zero forcing sets and the minimum rank of graphs
- The extremal function for \(K_{9}\) minors
- Homomorphiesätze für Graphen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Hadwiger’s Conjecture
- Nordhaus-Gaddum problems for Colin de Verdière type parameters, variants of tree-width, and related parameters
- An extremal function for contractions of graphs
- Every Planar Map is Four Colorable
- Contractions to k8
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Colin de Verdiere parameters of chordal graphs
This page was built for publication: The extremal function and Colin de Verdière graph parameter