A note on a matrix criterion for unique colorability of a signed graph
From MaRDI portal
Publication:2535987
DOI10.1007/BF02289592zbMath0184.49202WikidataQ70920492 ScholiaQ70920492MaRDI QIDQ2535987
Dorwin Cartwright, Terry C. Gleason
Publication date: 1967
Published in: Psychometrika (Search for Journal in Brave)
Related Items
On purely tree-colorable planar graphs, Least squares metric, unidimensional unfolding, A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph, Structural models with qualitative values
Cites Work