Equitable Total Coloring of Graphs with Maximum Degree 3

Weifan Wang

doi:10.1007/s003730200051

ScienceGate Book Chapters

JOURNAL ARTICLE

Equitable Total Coloring of Graphs with Maximum Degree 3

Weifan Wang

Year: 2002 Journal: Graphs and Combinatorics Vol: 18 (3)Pages: 677-685 Publisher: Springer Science+Business Media

DOI: 10.1007/s003730200051

Get Full-Text PDF Get Analytical Report

Keywords:

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

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.14

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

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Equitable Total Coloring of Graphs with Maximum Degree 3

Metrics

Citation History

Topics

Related Documents

Total Coloring Graphs With Large Maximum Degree

Equitable coloring and equitable choosability of graphs with small maximum average degree

Equitable List Coloring of Planar Graphs With Given Maximum Degree

Equitable list‐coloring for graphs of maximum degree 3

Equitable coloring of planar graphs with maximum degree at least eight