Group edge choosability of planar graphs without adjacent short cycles

Xin Zhang; Gui Zhen Liu

doi:10.1007/s10114-013-2531-3

ScienceGate Book Chapters

JOURNAL ARTICLE

Group edge choosability of planar graphs without adjacent short cycles

Xin Zhang Gui Zhen Liu

Year: 2013 Journal: Acta Mathematica Sinica English Series Vol: 29 (11)Pages: 2079-2086 Publisher: Springer Science+Business Media

DOI: 10.1007/s10114-013-2531-3

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Combinatorics Planar graph Planar Enhanced Data Rates for GSM Evolution Group (periodic table) Discrete mathematics Graph Telecommunications Physics Computer science

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.05

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

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Group edge choosability of planar graphs without adjacent short cycles

Metrics

Citation History

Topics

Related Documents

Edge choosability of planar graphs without short cycles

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

Acyclic 5-choosability of planar graphs without adjacent short cycles