Pages that link to "Item:Q2931404"
From MaRDI portal
The following pages link to Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs (Q2931404):
Displayed 9 items.
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- A relaxed Hadwiger's conjecture for list colorings (Q885300) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- Note on coloring graphs without odd-\(K_k\)-minors (Q1026013) (← links)
- List-coloring graphs without \(K_{4,k}\)-minors (Q1028458) (← links)
- On the excluded minor structure theorem for graphs of large tree-width (Q1931397) (← links)
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← links)
- (Q5743487) (← links)