Pages that link to "Item:Q885300"
From MaRDI portal
The following pages link to A relaxed Hadwiger's conjecture for list colorings (Q885300):
Displayed 18 items.
- Contractibility and the Hadwiger conjecture (Q710728) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- List-coloring graphs without \(K_{4,k}\)-minors (Q1028458) (← links)
- On group choosability of graphs. II (Q2014707) (← links)
- Immersion and clustered coloring (Q2099417) (← links)
- Connectivity and choosability of graphs with no \(K_t\) minor (Q2099418) (← links)
- Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs (Q2153396) (← links)
- Clustered variants of Hajós' conjecture (Q2664549) (← links)
- Hadwiger’s Conjecture (Q2827298) (← links)
- Disproof of the group coloring version of the Hadwiger conjecture (Q2920883) (← links)
- A Relative of Hadwiger's Conjecture (Q3461983) (← links)
- Graph coloring with no large monochromatic components (Q3503460) (← links)
- A Weakening of the Odd Hadwiger's Conjecture (Q3608337) (← links)
- Improper colouring of graphs with no odd clique minor (Q5222552) (← links)
- Colouring Planar Graphs With Three Colours and No Large Monochromatic Components (Q5495675) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5890901) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769) (← links)