Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference9 articles.
1. Barioli, F., Barrett, W., Fallat, S.M., Hall, H.T., Hogben, L., van der Holst, H.: On the graph complement conjecture for minimum rank. Linear Algebra Appl. 436(12), 4373–4391 (2012)
2. Barioli, F., Fallat, S.: On the minimum rank of the join of graphs and decomposable graphs. Linear Algebra Appl. 421(2–3), 252–263 (2007)
3. Goldberg, F., Berman, A.: On the Colin de Verdière number of graphs. Linear Algebra Appl. 434(7), 1656–1662 (2011)
4. Hogben, L.: Nordhaus–Gaddum problems for Colin de Verdière type parameters, variants of tree-width, and related parameters. In: Recent Trends in Combinatorics. IMA Volumes in Mathematics and its Applications, vol. 159, pp. 275–294. Springer, Cham (2016)
5. van der Holst, H., Lovász, L., Schrijver, A.: The Colin de Verdiére graph parameter. In: Graph Theory and Combinatorial Biology (Balatonlelle, 1996). Bolyai Society Mathematical Studies, vol. 7, pp. 29–85. János Bolyai Mathematical Society, Budapest (1999)