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

DOI10.1007/BF02289592MaRDI QIDQ2535987zbMATH OpenWikidataFDO

Authors Terry C. Gleason, Dorwin Cartwright

Publication date 1967

Published in Psychometrika (Search for Journal in Brave)

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

zbMATH Keywords

topology

Cites work

• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• On the coloring of signed graphs
• On the simultaneous diagonalization of two semi-definite matrices

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2535987)