The following pages link to (Q5578815):
Displaying 10 items.
- A sufficient condition for a graph to be weakly k-linked (Q790839) (← links)
- Universal tilings of the plane by 0-1 -matrices (Q920099) (← links)
- Consistent social choice functions and systems of distinct representatives (Q1062886) (← links)
- Handle bases and bounds on the number of subgraphs (Q1087883) (← links)
- The subgraph homeomorphism problem (Q1137871) (← links)
- Testing for Equality between Maximum Matching and Minimum Node Covering (Q1242177) (← links)
- A conjecture concerning strongly connected graphs (Q1301281) (← links)
- Motivations and history of some of my conjectures (Q1356729) (← links)
- A lower bound for the permanent on \(U_ n(k,k)\) (Q2536062) (← links)
- Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology (Q2557562) (← links)
