Defective choosability of graphs without small minors (Q2380248)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Defective choosability of graphs without small minors |
scientific article |
Statements
Defective choosability of graphs without small minors (English)
0 references
26 March 2010
0 references
Summary: For each proper subgraph \(H\) of \(K_5\), we determine all pairs \((k,d)\) such that every \(H\)-minor-free graph is \((k,d)^*\)-choosable or \((k, d)^-\)-choosable. The main structural lemma is that the only 3-connected \((K_5-e)\)-minor-free graphs are wheels, the triangular prism, and \(K_{3,3}\); this is used to prove that every \((K_5-e)\)-minor-free graph is 4-choosable and \((3,1)\)-choosable.
0 references
list colouring
0 references
defective choosability
0 references
minor-free graph
0 references