Relaxed Locally Identifying Coloring of Graphs

Méziane Aı̈der; Sylvain Gravier; Souad Slimani

doi:10.1007/s00373-016-1677-z

ScienceGate Book Chapters

JOURNAL ARTICLE

Relaxed Locally Identifying Coloring of Graphs

Méziane Aı̈der Sylvain Gravier Souad Slimani

Year: 2016 Journal: Graphs and Combinatorics Vol: 32 (5)Pages: 1651-1665 Publisher: Springer Science+Business Media

DOI: 10.1007/s00373-016-1677-z

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Fractional coloring Graph coloring Edge coloring List coloring Complete coloring Mathematics Greedy coloring Bipartite graph Brooks' theorem Discrete mathematics Vertex (graph theory) Graph Graph power Line graph

Metrics

Cited By

0.90

FWCI (Field Weighted Citation Impact)

Refs

0.81

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Relaxed Locally Identifying Coloring of Graphs

Metrics

Citation History

Topics

Related Documents

Relaxed Locally Identifying coloring of Graphs

On Locally Identifying Coloring of Graphs

Locally identifying coloring in some chordal graphs

Locally identifying coloring of corona product of graphs

Locally identifying coloring of graphs with few P4s