Pages that link to "Item:Q1297462"
From MaRDI portal
The following pages link to A sequential coloring algorithm for finite sets (Q1297462):
Displaying 6 items.
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Sequential coloring versus Welsh-Powell bound (Q1121275) (← links)
- Iterated colorings of graphs. (Q1427472) (← links)
- Coloring Ordered Sets to Avoid Monochromatic Maximal Chains (Q4022850) (← links)
- A color-to-spin domino Schensted algorithm (Q5934079) (← links)
- The colored longest common prefix array computed via sequential scans (Q6109741) (← links)