Pages that link to "Item:Q1850621"
From MaRDI portal
The following pages link to Asymptotically the list colouring constants are 1 (Q1850621):
Displaying 18 items.
- 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)
- An average degree condition for independent transversals (Q2668023) (← links)
- A note on vertex list colouring (Q2757076) (← links)
- List Colouring Constants of Triangle Free Graphs (Q3503542) (← links)
- An asymptotically tight bound on the adaptable chromatic number (Q4650185) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Adaptable and conflict colouring multigraphs with no cycles of length three or four (Q6047975) (← links)
- Colorings, transversals, and local sparsity (Q6074708) (← links)
- (Q6084349) (← links)
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
- On triangle-free list assignments (Q6184549) (← links)
- Packing list‐colorings (Q6185050) (← links)
- Constructing graphs with no independent transversals (Q6574378) (← links)
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)
- A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree (Q6632801) (← links)
