A note on not-4-list colorable planar graphs
type: Item
instance of: scholarly article
title: A note on not-4-list colorable planar graphs
zbMATH Open document ID: 1388.05048
author: Arnfried Kemnitz
author: Margit Voigt
published in: The Electronic Journal of Combinatorics
publication date: 2018-06-14T00:00:00Z
full work available at URL: v25i2p46
review text: Summary: The four color theorem states that every planar graph is properly 4-colorable. Moreover, it is well known that there are planar graphs that are non-4-list colorable. In this paper we investigate a problem combining proper colorings and list colorings. We ask whether the vertex set of every planar graph can be partitioned into two subsets where one subset induces a bipartite graph and the other subset induces a 2-list colorable graph. We answer this question in the negative strengthening the result on non-4-list colorable planar graphs.
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6888455
zbMATH Keywords: list colouring
zbMATH Keywords: planar graph
MaRDI profile type: Publication
cites work: Every Planar Map is Four Colorable
cites work: On \(t\)-common list-colorings
cites work: Brooks-type theorems for choosability with separation
cites work: Complexity of choosing subsets from color sets
cites work: Q4340879
cites work: Every planar graph is 5-choosable
cites work: List colourings of planar graphs
cites work: Note on a paper of B. Grünbaum on acyclic colorings
description: scientific article; zbMATH DE number 6888455