Equitable defective coloring of sparse planar graphs

Lee Williams; Jennifer Vandenbussche; Gexin Yu

doi:10.1016/j.disc.2011.10.024

ScienceGate Book Chapters

JOURNAL ARTICLE

Equitable defective coloring of sparse planar graphs

Lee Williams Jennifer Vandenbussche Gexin Yu

Year: 2011 Journal: Discrete Mathematics Vol: 312 (5)Pages: 957-962 Publisher: Elsevier BV

DOI: 10.1016/j.disc.2011.10.024

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Graph coloring Complete coloring Planar graph Brooks' theorem Fractional coloring List coloring Edge coloring Greedy coloring Discrete mathematics Vertex (graph theory) Graph Integer (computer science) 1-planar graph Chordal graph Graph power Line graph Computer science

Metrics

Cited By

0.64

FWCI (Field Weighted Citation Impact)

Refs

0.67

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

Computational Geometry and Mesh Generation

Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Equitable defective coloring of sparse planar graphs

Metrics

Citation History

Topics

Related Documents

Equitable Coloring of Sparse Planar Graphs

Equitable list coloring of sparse graphs

Equitable coloring in 1-planar graphs

Equitable coloring planar graphs with large girth

Odd coloring of sparse graphs and planar graphs