The following pages link to Low weight perfect matchings (Q2223441):
Displaying 10 items.
- On the number of group-weighted matchings (Q1386528) (← links)
- Group weighted matchings in bipartite graphs (Q1804248) (← links)
- Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\) (Q2000579) (← links)
- On zero-sum spanning trees and zero-sum connectivity (Q2073300) (← links)
- Zero-sum copies of spanning forests in zero-sum complete graphs (Q2162505) (← links)
- Almost color-balanced perfect matchings in color-balanced complete graphs (Q2666593) (← links)
- Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation (Q2685699) (← links)
- Unbalanced spanning subgraphs in edge labeled complete graphs (Q2692172) (← links)
- The balancing number and generalized balancing number of some graph classes (Q2692189) (← links)
- On the existence of zero-sum perfect matchings of complete graphs (Q5881014) (← links)
