Pages that link to "Item:Q1917503"
From MaRDI portal
The following pages link to A Hajós-like theorem for list coloring (Q1917503):
Displaying 9 items.
- On-line choice number of complete multipartite graphs: an algorithmic approach (Q490305) (← links)
- Grassmann homomorphism and Hajós-type theorems (Q518115) (← links)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- Hajós' theorem for list coloring (Q1886360) (← links)
- Hajós and Ore constructions for digraphs (Q2309234) (← links)
- On \(t\)-common list-colorings (Q2401414) (← links)
- Hajós-like theorem for signed graphs (Q2408976) (← links)
- Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (Q2636827) (← links)
- HAJÓS-LIKE THEOREM FOR GROUP COLORING (Q3063613) (← links)
