Choosability of \(K_5\)-minor-free graphs
type: Item
instance of: scholarly article
title: Choosability of \(K_5\)-minor-free graphs
zbMATH Open document ID: 0955.05043
DOI: 10.1016/S0012-365X(98)00158-7
author: Riste Škrekovski
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1524984
zbMATH Keywords: choosability
zbMATH Keywords: list coloring
MaRDI profile type: Publication
cites work: Q3852212
cites work: Q4342632
cites work: Q3922703
cites work: Über einen Satz von K.Wagner zum Vierfarbenproblem
cites work: Every planar graph is 5-choosable
cites work: Q3115277
cites work: Über eine Eigenschaft der ebenen Komplexe
full work available at URL: s0012-365x(98)00158-7
OpenAlex ID: W143450761
description: scientific article; zbMATH DE number 1524984