Pages that link to "Item:Q2703027"
From MaRDI portal
The following pages link to Algorithmic aspects of partial list colourings (Q2703027):
Displaying 9 items.
- Asymmetric list sizes in bipartite graphs (Q825958) (← links)
- Partial list colouring of certain graphs (Q888600) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- Partial online list coloring of graphs (Q2862550) (← links)
- Near-optimal list colorings (Q4521554) (← links)
- A lower bound for partial list colorings (Q4719327) (← links)
- Algorithmic discrepancy beyond partial coloring (Q4978034) (← links)
- Recent Advances in Constraints (Q5899108) (← links)