The following pages link to (Q4248539):
Displayed 10 items.
- The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (Q998415) (← links)
- Asymptotically the list colouring constants are 1 (Q1850621) (← links)
- Cooperative colorings and independent systems of representatives (Q2346466) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- Independent transversals in locally sparse graphs (Q2384801) (← links)
- List Colouring Constants of Triangle Free Graphs (Q3503542) (← links)
- (Q4521553) (← links)
- (Q4521554) (← links)
- An asymptotically tight bound on the adaptable chromatic number (Q4650185) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)