Pages that link to "Item:Q2811205"
From MaRDI portal
The following pages link to List colorings with distinct list sizes, the case of complete bipartite graphs (Q2811205):
Displaying 9 items.
- Lower bounds on the sum choice number of a graph (Q327690) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Bounds for the sum choice number (Q2413335) (← links)
- Proportional choosability of complete bipartite graphs (Q2657094) (← links)
- List colorings with distinct list sizes, the case of complete bipartite graphs (Q2851483) (← links)
- Balanced list edge-colourings of bipartite graphs (Q2861497) (← links)
- The interactive sum choice number of graphs (Q5915807) (← links)
- The interactive sum choice number of graphs (Q5919074) (← links)
- Coloring bipartite graphs with semi-small list size (Q6065679) (← links)