Equitable colorings of planar graphs with maximum degree at least nine

Kittikorn Nakprasit

doi:10.1016/j.disc.2011.11.004

ScienceGate Book Chapters

JOURNAL ARTICLE

Equitable colorings of planar graphs with maximum degree at least nine

Kittikorn Nakprasit

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

DOI: 10.1016/j.disc.2011.11.004

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Combinatorics Planar graph Degree (music) Planar Graph Discrete mathematics Outerplanar graph Graph coloring List coloring Edge coloring 1-planar graph Chordal graph Pathwidth Graph power Line graph Computer science

Metrics

Cited By

2.55

FWCI (Field Weighted Citation Impact)

Refs

0.89

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

Equitable colorings of planar graphs with maximum degree at least nine

Metrics

Citation History

Topics

Related Documents

Total colorings of planar graphs with maximum degree at least 8

Equitable coloring of planar graphs with maximum degree at least eight

Total colorings of planar graphs with large maximum degree

Total colorings of planar graphs with large maximum degree

Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten