The following pages link to Recognizing balanceable matrices (Q2583120):
Displaying 8 items.
- Testing balancedness and perfection of linear matrices (Q689142) (← links)
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
- An algorithm for identifying Morishima and anti-Morishima matrices and balanced digraphs (Q1059646) (← links)
- Properties of balanced and perfect matrices (Q1194854) (← links)
- How many matrices can be spectrally balanced simultaneously? (Q1650021) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- A polynomial recognition algorithm for balanced matrices (Q2565686) (← links)
- On minimal forbidden subgraph characterizations of balanced graphs (Q5891090) (← links)