A note on 3-choosability of planar graphs

Yingqian Wang; Huajing Lu; Ming Chen

doi:10.1016/j.ipl.2007.08.027

ScienceGate Book Chapters

JOURNAL ARTICLE

A note on 3-choosability of planar graphs

Yingqian Wang Huajing Lu Ming Chen

Year: 2007 Journal: Information Processing Letters Vol: 105 (5)Pages: 206-211 Publisher: Elsevier BV

DOI: 10.1016/j.ipl.2007.08.027

Get Full-Text PDF Get Analytical Report

Keywords:

Planar graph Combinatorics Outerplanar graph Mathematics Planar straight-line graph Planar Book embedding Graph minor 1-planar graph Discrete mathematics Pathwidth Graph Chordal graph Computer science Graph power Line graph

Metrics

Cited By

1.61

FWCI (Field Weighted Citation Impact)

Refs

0.83

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

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

A note on 3-choosability of planar graphs

Metrics

Citation History

Topics

Related Documents

A note on the acyclic 3-choosability of some planar graphs

A note on 3-choosability of planar graphs without certain cycles

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

A Note on 3-choosability of Planar Graphs Related to Montanssier’s Conjecture

Choosability of planar graphs