Planar graphs without specific cycles are 2-degenerate
type: Item
instance of: scholarly article
title: Planar graphs without specific cycles are 2-degenerate
zbMATH Open document ID: 1467.05046
author: Patcharapan Jumnongnit
author: Wannapol Pimpasalee
published in: Discrete Mathematics
publication date: 2021-07-08T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 7369627
zbMATH Keywords: 2-degenerate graph
zbMATH Keywords: planar graph
zbMATH Keywords: 3-choosability
zbMATH Keywords: forbidden cycle
MaRDI profile type: Publication
full work available at URL: j.disc.2021.112488
OpenAlex ID: W3171363478
cites work: Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
cites work: Planar graphs without cycles of specific lengths
cites work: The 3-choosability of plane graphs of girth 4
cites work: Q3635511
cites work: DP-4-colorability of planar graphs without adjacent cycles of given length
cites work: DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
cites work: DP-3-coloring of some planar graphs
cites work: A sufficient condition for a planar graph to be 3-choosable
cites work: 3-list-coloring planar graphs of girth 5
cites work: Q4135588
cites work: Choosability and edge choosability of planar graphs without five cycles
cites work: A note on 3-choosability of planar graphs
cites work: Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
cites work: A note on 3-choosability of planar graphs without certain cycles
DOI: 10.1016/J.DISC.2021.112488
description: scientific article; zbMATH DE number 7369627