On Choosability with Separation of Planar Graphs Without Adjacent Short Cycles

Min Chen; Ko‐Wei Lih; Weifan Wang

doi:10.1007/s40840-016-0409-0

ScienceGate Book Chapters

JOURNAL ARTICLE

On Choosability with Separation of Planar Graphs Without Adjacent Short Cycles

Min Chen Ko‐Wei Lih Weifan Wang

Year: 2016 Journal: Bulletin of the Malaysian Mathematical Sciences Society Vol: 41 (3)Pages: 1507-1518 Publisher: Springer Science+Business Media

DOI: 10.1007/s40840-016-0409-0

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Planar graph Vertex (graph theory) Graph List coloring Discrete mathematics Graph power Line graph

Metrics

Cited By

0.90

FWCI (Field Weighted Citation Impact)

Refs

0.83

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

On Choosability with Separation of Planar Graphs Without Adjacent Short Cycles

Metrics

Citation History

Topics

Related Documents

Acyclic 4-choosability of planar graphs without adjacent short cycles

Acyclic 6-choosability of planar graphs without adjacent short cycles

(3, 1)*-choosability of planar graphs without adjacent short cycles

Group edge choosability of planar graphs without adjacent short cycles

Acyclic 5-choosability of planar graphs without adjacent short cycles