Total coloring of embedded graphs of maximum degree at least ten

Jianfeng Hou; Jianliang Wu; Guizhen Liu; Bin Liu

doi:10.1007/s11425-010-3089-5

ScienceGate Book Chapters

JOURNAL ARTICLE

Total coloring of embedded graphs of maximum degree at least ten

Jianfeng Hou Jianliang Wu Guizhen Liu Bin Liu

Year: 2010 Journal: Science China Mathematics Vol: 53 (8)Pages: 2127-2133 Publisher: Springer Nature

DOI: 10.1007/s11425-010-3089-5

Get Full-Text PDF Get Analytical Report

Keywords:

Total coloring Mathematics Combinatorics Brooks' theorem Degree (music) Edge coloring Graph Fractional coloring Complete coloring Chromatic scale List coloring Integer (computer science) Discrete mathematics Graph power 1-planar graph Chordal graph Physics Computer science

Metrics

Cited By

1.04

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

Total coloring of embedded graphs of maximum degree at least ten

Metrics

Citation History

Topics

Related Documents

Total coloring of embedded graphs of maximum degree at least ten

Total coloring of embedded graphs with maximum degree at least seven

Total Coloring of Embedded Graphs with Maximum Degree at Least Eight

Total Coloring Graphs With Large Maximum Degree

The list coloring and list total coloring of planar graphs with maximum degree at least 7