Edge-choosability of planar graphs without adjacent triangles or without 7-cycles

Jianfeng Hou; Guizhen Liu; Jiansheng Cai

doi:10.1016/j.disc.2007.12.046

ScienceGate Book Chapters

JOURNAL ARTICLE

Edge-choosability of planar graphs without adjacent triangles or without 7-cycles

Jianfeng Hou Guizhen Liu Jiansheng Cai

Year: 2008 Journal: Discrete Mathematics Vol: 309 (1)Pages: 77-84 Publisher: Elsevier BV

DOI: 10.1016/j.disc.2007.12.046

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Combinatorics Planar graph Graph Edge coloring Enhanced Data Rates for GSM Evolution Discrete mathematics Graph power Line graph Computer science Artificial intelligence

Metrics

Cited By

1.03

FWCI (Field Weighted Citation Impact)

Refs

0.79

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

Edge-choosability of planar graphs without adjacent triangles or without 7-cycles

Metrics

Citation History

Topics

Related Documents

Group edge choosability of planar graphs without adjacent short cycles

Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

Total Group Choosability of Planar Graphs without Adjacent Triangles

Edge choosability of planar graphs without small cycles

Choosability and edge choosability of planar graphs without five cycles