Pages that link to "Item:Q2535987"

The following pages link to A note on a matrix criterion for unique colorability of a signed graph (Q2535987):

Displaying 4 items.

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