Another proof of the 5-choosability of \(K_5\)-minor-free graphs
type: Item
instance of: scholarly article
title: Another proof of the 5-choosability of \(K_5\)-minor-free graphs
zbMATH Open document ID: 1155.05023
author: Wenjie He
author: Wenjing Miao
author: Yufa Shen
published in: Discrete Mathematics
publication date: 2008-07-11T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C83
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5300661
zbMATH Keywords: list coloring
zbMATH Keywords: choosability
zbMATH Keywords: Wagner graph
zbMATH Keywords: \(K_5\)-minor-free
zbMATH Keywords: planar graph
MaRDI profile type: Publication
full work available at URL: j.disc.2007.07.089
OpenAlex ID: W1978082980
cites work: Q4947393
cites work: Q3922703
cites work: Choosability of \(K_5\)-minor-free graphs
cites work: Every planar graph is 5-choosable
cites work: Q3115277
cites work: Über eine Eigenschaft der ebenen Komplexe
DOI: 10.1016/J.DISC.2007.07.089
description: scientific article; zbMATH DE number 5300661