research
∙
09/06/2021
Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
Let M=(m_ij) be a symmetric matrix of order n whose elements lie in an a...
share
research
∙
01/29/2021
Counting orientations of graphs with no strongly connected tournaments
Let S_k(n) be the maximum number of orientations of an n-vertex graph G ...
research
∙
12/02/2019
