Pages that link to "Item:Q698614"
From MaRDI portal
The following pages link to On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs (Q698614):
Displaying 11 items.
- Panchromatic 3-coloring of a random hypergraph (Q1690010) (← links)
- A note on panchromatic colorings (Q1690224) (← links)
- Panchromatic colorings of random hypergraphs (Q1996843) (← links)
- Chain method for panchromatic colorings of hypergraphs (Q2172391) (← links)
- The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets (Q2191992) (← links)
- Panchromatic 3-colorings of random hypergraphs (Q2422211) (← links)
- On a generalization of Rubin's theorem (Q3018075) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- List colorings of multipartite hypergraphs (Q5216184) (← links)
- Improper Choosability and Property B (Q5325946) (← links)
- Choosability with Separation of Complete Multipartite Graphs and Hypergraphs (Q5418773) (← links)