The 4-choosability of plane graphs without 4-cycles
type: Item
instance of: scholarly article
title: The 4-choosability of plane graphs without 4-cycles
zbMATH Open document ID: 0931.05036
author: Jiazhuang Liu
author: P. C. B. Lam
author: Baogang Xu
published in: Journal of Combinatorial Theory. Series B
publication date: 1999-10-04T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1346890
zbMATH Keywords: faces
zbMATH Keywords: choosabiilty
zbMATH Keywords: triangle
zbMATH Keywords: vertex coloring
zbMATH Keywords: plane graph
zbMATH Keywords: 4-cycles
MaRDI profile type: Publication
full work available at URL: jctb.1998.1893
OpenAlex ID: W2082129852
cites work: Colorings and orientations of graphs
cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
cites work: Q3097395
cites work: Q3922703
cites work: Q3139765
cites work: Every planar graph is 5-choosable
cites work: 3-list-coloring planar graphs of girth 5
cites work: Q3115277
cites work: List colourings of planar graphs
cites work: A not 3-choosable planar graph without 3-cycles
cites work: Q3122897
DOI: 10.1006/JCTB.1998.1893
description: scientific article; zbMATH DE number 1346890