Injective edge-coloring of graphs with given maximum degree

Alexandr Kostochka; André Raspaud; Jingwei Xu

doi:10.1016/j.ejc.2021.103355

ScienceGate Book Chapters

JOURNAL ARTICLE

Injective edge-coloring of graphs with given maximum degree

Alexandr Kostochka André Raspaud Jingwei Xu

Year: 2021 Journal: European Journal of Combinatorics Vol: 96 Pages: 103355-103355 Publisher: Elsevier BV

DOI: 10.1016/j.ejc.2021.103355

Get Full-Text PDF Get Analytical Report

Keywords:

Injective function Mathematics Combinatorics Edge coloring Chromatic scale Degree (music) Graph Brooks' theorem Discrete mathematics 1-planar graph Chordal graph Graph power Physics Line graph

Metrics

Cited By

4.16

FWCI (Field Weighted Citation Impact)

Refs

0.94

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

Injective edge-coloring of graphs with given maximum degree

Metrics

Citation History

Topics

Related Documents

Injective edge coloring of graphs with maximum degree 5

Injective edge coloring of sparse graphs with maximum degree 5

On injective edge-coloring of graphs with maximum degree 4

On injective edge coloring of sparse graphs with maximum degree 5

Injective Edge-Coloring of Planar Graphs with Maximum Degree at Most 5