Choosability and edge choosability of planar graphs without five cycles

Weifan Wang; Ko‐Wei Lih

doi:10.1016/s0893-9659(02)80007-6

ScienceGate Book Chapters

JOURNAL ARTICLE

Choosability and edge choosability of planar graphs without five cycles

Weifan Wang Ko‐Wei Lih

Year: 2002 Journal: Applied Mathematics Letters Vol: 15 (5)Pages: 561-565 Publisher: Elsevier BV

DOI: 10.1016/s0893-9659(02)80007-6

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Planar graph Combinatorics Planar Degenerate energy levels Enhanced Data Rates for GSM Evolution Outerplanar graph Planar straight-line graph Graph 1-planar graph Pathwidth Chordal graph Line graph Artificial intelligence Computer science Computer graphics (images)

Metrics

107

Cited By

2.03

FWCI (Field Weighted Citation Impact)

Refs

0.86

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

Choosability and edge choosability of planar graphs without five cycles

Metrics

Citation History

Topics

Related Documents

Edge choosability of planar graphs without small cycles

Edge choosability of planar graphs without short cycles

Edge choosability of planar graphs without small cycles

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

Group edge choosability of planar graphs without adjacent short cycles