A note on a matrix criterion for unique colorability of a signed graph

DOI10.1007/BF02289592zbMath0184.49202WikidataQ70920492 ScholiaQ70920492MaRDI QIDQ2535987

Dorwin Cartwright, Terry C. Gleason

Publication date: 1967

Published in: Psychometrika (Search for Journal in Brave)

zbMATH Keywords

topology

Related Items (4)

On purely tree-colorable planar graphs ⋮ A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph ⋮ Least squares metric, unidimensional unfolding ⋮ Structural models with qualitative values

Cites Work

• Unnamed Item
• On the coloring of signed graphs
• On the simultaneous diagonalization of two semi-definite matrices

This page was built for publication: A note on a matrix criterion for unique colorability of a signed graph