Pages that link to "Item:Q1293418"
From MaRDI portal
The following pages link to The choice number of random bipartite graphs (Q1293418):
Displaying 12 items.
- Dense uniform hypergraphs have high list chromatic number (Q432708) (← links)
- Two problems on independent sets in graphs (Q641174) (← links)
- Asymmetric list sizes in bipartite graphs (Q825958) (← links)
- On generalized choice and coloring numbers (Q1733934) (← links)
- Cooperative colorings of trees and of bipartite graphs (Q2294110) (← links)
- Hypergraph list coloring and Euclidean Ramsey theory (Q3094608) (← links)
- List colorings of multipartite hypergraphs (Q5216184) (← links)
- Separation Choosability and Dense Bipartite Induced Subgraphs (Q5222550) (← links)
- Independent transversals in bipartite correspondence-covers (Q5888915) (← links)
- Coloring bipartite graphs with semi-small list size (Q6065679) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- Packing list‐colorings (Q6185050) (← links)
