Spectral characterization of tree-width-two graphs

DOI10.1007/s004930070038zbMath0980.05043OpenAlexW2049564936MaRDI QIDQ5932703

Andreĭ V. Kotlov

Publication date: 13 June 2001

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930070038

zbMATH Keywords

tree-width-two graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (6)

The inertia set of a signed graph ⋮ Signed graphs whose signed Colin de Verdière parameter is two ⋮ Some connectivity properties for excluded minors of the graph invariant \(\nu(G)\) ⋮ Graphs whose positive semi-definite matrices have nullity at most two ⋮ Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph ⋮ Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope

This page was built for publication: Spectral characterization of tree-width-two graphs