Edge choosability of planar graphs without small cycles

Li Zhang; Baoyindureng Wu

doi:10.1016/j.disc.2004.01.001

ScienceGate Book Chapters

JOURNAL ARTICLE

Edge choosability of planar graphs without small cycles

Li Zhang Baoyindureng Wu

Year: 2004 Journal: Discrete Mathematics Vol: 283 (1-3)Pages: 289-293 Publisher: Elsevier BV

DOI: 10.1016/j.disc.2004.01.001

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Combinatorics Planar graph Enhanced Data Rates for GSM Evolution Outerplanar graph Planar Discrete mathematics Pathwidth Graph Artificial intelligence Computer science Line graph

Metrics

Cited By

2.01

FWCI (Field Weighted Citation Impact)

Refs

0.85

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

Edge choosability of planar graphs without small cycles

Metrics

Citation History

Topics

Related Documents

Edge choosability of planar graphs without small cycles

Choosability and edge choosability of planar graphs without five cycles

Edge choosability of planar graphs without short cycles

Acyclic 5‐choosability of planar graphs without small cycles

Group edge choosability of planar graphs without adjacent short cycles