On \((3, r)\)-choosability of some planar graphs
type: Item
instance of: scholarly article
title: On \((3, r)\)-choosability of some planar graphs
zbMATH Open document ID: 1485.05062
author: Heng Li
author: Hongguo Zhu
author: Jianfeng Hou
published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 7493945
zbMATH Keywords: choosability with union separation
zbMATH Keywords: planar graph
zbMATH Keywords: chorded cycle
zbMATH Keywords: triangle
MaRDI profile type: Publication
full work available at URL: s40840-021-01218-4
OpenAlex ID: W4206560000
cites work: Colorings and orientations of graphs
cites work: On choosability with separation of planar graphs without adjacent short cycles
cites work: Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
cites work: Q3922703
cites work: Planar graphs without intersecting 5-cycles are 4-choosable
cites work: Choosability with union separation of triangle-free planar graphs
cites work: List coloring triangle‐free planar graphs
cites work: Choosability with union separation
cites work: The 4-choosability of plane graphs without 4-cycles
cites work: Every planar graph without adjacent cycles of length at most 8 is 3-choosable
cites work: 3-list-coloring planar graphs of girth 5
cites work: Every planar graph is 5-choosable
cites work: Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
DOI: 10.1007/S40840-021-01218-4
description: scientific article; zbMATH DE number 7493945