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

François Dross; Borut Lužar; Mária Maceková; Roman Soták

doi:10.1016/j.disc.2019.06.021

ScienceGate Book Chapters

JOURNAL ARTICLE

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

François Dross Borut Lužar Mária Maceková Roman Soták

Year: 2019 Journal: Discrete Mathematics Vol: 342 (11)Pages: 3123-3129 Publisher: Elsevier BV

DOI: 10.1016/j.disc.2019.06.021

Get Full-Text PDF Get Analytical Report

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

Cited By

0.64

FWCI (Field Weighted Citation Impact)

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

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

Metrics

Citation History

Topics

Related Documents

On 3-Choosability of Planar Graphs with Maximum Degree 4

Total choosability of planar graphs with maximum degree 4

A note on 3-choosability of planar graphs

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

Acyclic Choosability of Graphs with Small Maximum Degree