The following pages link to Near-optimal list colorings (Q4521554):
Displaying 34 items.
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- List colouring when the chromatic number is close to the order of the graph (Q558319) (← links)
- A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs (Q612968) (← links)
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613) (← links)
- Tight embeddings of partial quadrilateral packings (Q965225) (← links)
- List-colourings of graphs (Q1084403) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- Asymptotically good list-colorings (Q1906118) (← links)
- On proper colorings of hypergraphs (Q1930218) (← links)
- List coloring hypergraphs (Q1960283) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- The \(n\)-queens completion problem (Q2157925) (← links)
- List supermodular coloring with shorter lists (Q2322511) (← links)
- Asymptotically optimal neighbor sum distinguishing total colorings of graphs (Q2374159) (← links)
- List supermodular coloring (Q2419323) (← links)
- On a hypergraph matching problem (Q2494110) (← links)
- On the chromatic number of Latin square graphs (Q2629269) (← links)
- Coloring sparse hypergraphs (Q2813339) (← links)
- Approximating List-Coloring on a Fixed Surface (Q3521930) (← links)
- Acyclic edge colourings of graphs with large girth (Q4978429) (← links)
- Pseudorandom hypergraph matchings (Q4993112) (← links)
- Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture (Q5138970) (← links)
- Efficiently list-edge coloring multigraphs asymptotically optimally (Q5146931) (← links)
- List colorings of multipartite hypergraphs (Q5216184) (← links)
- Edge‐coloring linear hypergraphs with medium‐sized edges (Q5236928) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5899384) (← links)
- Asymptotically good edge correspondence colourings (Q6081556) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)
- Edge-colouring graphs with local list sizes (Q6187343) (← links)
- Asymptotically good local list edge colourings (Q6621166) (← links)
- A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree (Q6632801) (← links)
