Acyclic coloring of graphs with maximum degree at most six

Juan Wang; Lianying Miao

doi:10.1016/j.disc.2019.06.012

ScienceGate Book Chapters

JOURNAL ARTICLE

Acyclic coloring of graphs with maximum degree at most six

Juan Wang Lianying Miao

Year: 2019 Journal: Discrete Mathematics Vol: 342 (11)Pages: 3025-3033 Publisher: Elsevier BV

DOI: 10.1016/j.disc.2019.06.012

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Brooks' theorem Conjecture Edge coloring Complete coloring Fractional coloring Degree (music) Colored List coloring Chromatic scale Discrete mathematics Integer (computer science) Directed acyclic graph Vertex (graph theory) Graph Chordal graph 1-planar graph Graph power Computer science

Metrics

Cited By

1.07

FWCI (Field Weighted Citation Impact)

Refs

0.78

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

Acyclic coloring of graphs with maximum degree at most six

Metrics

Citation History

Topics

Related Documents

Acyclic Coloring of Graphs with Maximum Degree 7

Acyclic edge coloring of graphs with maximum degree 4

Acyclic Coloring of Graphs of Maximum Degree $\Delta$

Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree

Acyclic vertex coloring of graphs of maximum degree six