On strong edge-coloring of graphs with maximum degree 4

Jian-Bo Lv; Xiangwen Li; Gexin Yu

doi:10.1016/j.dam.2017.09.006

ScienceGate Book Chapters

JOURNAL ARTICLE

On strong edge-coloring of graphs with maximum degree 4

Jian-Bo Lv Xiangwen Li Gexin Yu

Year: 2017 Journal: Discrete Applied Mathematics Vol: 235 Pages: 142-153 Publisher: Elsevier BV

DOI: 10.1016/j.dam.2017.09.006

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Degree (music) Edge coloring Combinatorics Brooks' theorem Enhanced Data Rates for GSM Evolution Graph coloring Complete coloring Discrete mathematics Chordal graph 1-planar graph Graph Artificial intelligence Computer science Line graph

Metrics

Cited By

0.13

FWCI (Field Weighted Citation Impact)

Refs

0.56

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Wireless Network Optimization

Physical Sciences → Engineering → Electrical and Electronic Engineering

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Mobile Ad Hoc Networks

Physical Sciences → Computer Science → Computer Networks and Communications

On strong edge-coloring of graphs with maximum degree 4

Metrics

Citation History

Topics

Related Documents

List strong edge-coloring of graphs with maximum degree 4

On strong edge-coloring of graphs with maximum degree 5

List strong edge coloring of planar graphs with maximum degree 4

Strong edge-coloring of graphs with maximum degree 4 using 22 colors

Strong edge-coloring of graphs with maximum edge weight seven