The following pages link to (Q3348434):
Displaying 14 items.
- Coloring vertices of a graph or finding a Meyniel obstruction (Q418741) (← links)
- Exponentiality of the exchange algorithm for finding another room-partitioning (Q496707) (← links)
- On existence theorems (Q686508) (← links)
- A polynomial path-following interior point algorithm for general linear complementarity problems (Q989885) (← links)
- EP theorem for dual linear complementarity problems (Q1016385) (← links)
- Some graphic uses of an even number of odd nodes (Q1296145) (← links)
- Coloured matchings in bipartite graphs (Q1357740) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- EP theorems and linear complementarity problems (Q1392569) (← links)
- Balanced matrices (Q2433704) (← links)
- On balanced graphs (Q2583124) (← links)
- On finding another room-partitioning of the vertices (Q2861564) (← links)
- Colouring Some Classes of Perfect Graphs Robustly (Q3439399) (← links)
- The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems (Q5167105) (← links)