Nordhaus-Gaddum problems for Colin de Verdière type parameters, variants of tree-width, and related parameters

DOI10.1007/978-3-319-24298-9_12zbMath1354.05080OpenAlexW2493470262MaRDI QIDQ2957184

Leslie Hogben

Publication date: 25 January 2017

Published in: Recent Trends in Combinatorics (Search for Journal in Brave)

Full work available at URL: https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1215&context=math_pubs

zbMATH Keywords

tree-widthminimum rankmaximum nullityNordhaus-Gaddum problemColin de Verdière type parametersHalin S-functions

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Connectivity (05C40)

Related Items (6)

The complement problem for linklessly embeddable graphs ⋮ On Euclidean distances and sphere representations ⋮ Unnamed Item ⋮ A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph ⋮ The extremal function and Colin de Verdière graph parameter ⋮ The Colin de Verdière number and joins of graphs

This page was built for publication: Nordhaus-Gaddum problems for Colin de Verdière type parameters, variants of tree-width, and related parameters