JOURNAL ARTICLE

Note on 3-choosability of planar graphs with maximum degree 4

François DrossBorut LužarMária MacekováRoman Soták

Year: 2019 Journal:   Discrete Mathematics Vol: 342 (11)Pages: 3123-3129   Publisher: Elsevier BV
Keywords:
Combinatorics Mathematics Planar graph Bipartite graph 1-planar graph Outerplanar graph Discrete mathematics Degree (music) Pathwidth Book embedding Graph Chordal graph Line graph

Metrics

3
Cited By
0.64
FWCI (Field Weighted Citation Impact)
30
Refs
0.69
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Computational Geometry and Mesh Generation
Physical Sciences →  Computer Science →  Computer Graphics and Computer-Aided Design
Optimization and Search Problems
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

JOURNAL ARTICLE

Total choosability of planar graphs with maximum degree 4

Nicolas Roussel

Journal:   Discrete Applied Mathematics Year: 2010 Vol: 159 (1)Pages: 87-89
JOURNAL ARTICLE

A note on 3-choosability of planar graphs

Yingqian WangHuajing LuMing Chen

Journal:   Information Processing Letters Year: 2007 Vol: 105 (5)Pages: 206-211
JOURNAL ARTICLE

2-Distance choosability of planar graphs with a restriction for maximum degree

Jiahao YuMin ChenWeifan Wang

Journal:   Applied Mathematics and Computation Year: 2023 Vol: 448 Pages: 127949-127949
BOOK-CHAPTER

Acyclic Choosability of Graphs with Small Maximum Degree

Daniel GonçalvesMickaël Montassier

Lecture notes in computer science Year: 2005 Pages: 239-248
© 2026 ScienceGate Book Chapters — All rights reserved.