The following pages link to (Q3356317):
Displaying 13 items.
- Every graph \(G\) is Hall \(\Delta(G)\)-extendible (Q727195) (← links)
- Extending Hall's theorem into list colorings: a partial history (Q925374) (← links)
- Hall number for list colorings of graphs: Extremal results (Q960954) (← links)
- The Hall number, the Hall index, and the total Hall number of a graph (Q1293202) (← links)
- Hall's condition for list-coloring, and the Hall parameters: Recent developments (Q1598850) (← links)
- Hall ratio of the Mycielski graphs (Q2501574) (← links)
- Completing partial proper colorings using Hall's condition (Q2517653) (← links)
- Hall's theorem revisited (Q2723513) (← links)
- Extremal jumps of the Hall number (Q3439568) (← links)
- (Q5109073) (← links)
- (Q5377013) (← links)
- (Q5738655) (← links)
- Flexible list colorings: maximizing the number of requests satisfied (Q6565815) (← links)