Planar graphs without 4-cycles adjacent to triangles are 4-choosable
type: Item
instance of: scholarly article
title: Planar graphs without 4-cycles adjacent to triangles are 4-choosable
zbMATH Open document ID: 1343.05053
author: Panpan Cheng
author: Min Chen
author: Yingqian Wang
published in: Discrete Mathematics
publication date: 2016-08-16T00:00:00Z
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 6617202
zbMATH Keywords: planar graph
zbMATH Keywords: triangular 4-cycle
zbMATH Keywords: choosability
zbMATH Keywords: discharging
MaRDI profile type: Publication
full work available at URL: j.disc.2016.06.009
OpenAlex ID: W2478124327
cites work: Q5422499
cites work: Q3922703
cites work: Planar Graphs without 7-Cycles Are 4-Choosable
cites work: Planar graphs without cycles of specific lengths
cites work: The complexity of planar graph choosability
cites work: The 4-choosability of plane graphs without 4-cycles
cites work: Every planar graph is 5-choosable
cites work: List colourings of planar graphs
cites work: Choosability and edge choosability of planar graphs without five cycles
cites work: Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
DOI: 10.1016/J.DISC.2016.06.009
description: scientific article; zbMATH DE number 6617202