The following pages link to Fair splitting of colored paths (Q2401427):
Displaying 6 items.
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Fair splittings by independent sets in sparse graphs (Q2182042) (← links)
- Fair representation in the intersection of two matroids (Q2409842) (← links)
- The structural complexity landscape of finding balance-fair shortest paths (Q2676473) (← links)
- SPLITTING LOOPS AND NECKLACES: VARIANTS OF THE SQUARE PEG PROBLEM (Q5210688) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
