JOURNAL ARTICLE
A Simple Competitive Graph Coloring Algorithm
Year: 2000 Journal: Journal of Combinatorial Theory Series B Vol: 78 (1)Pages: 57-68 Publisher: Elsevier BV
Keywords:
Combinatorics Chordal graph Graph coloring Mathematics Outerplanar graph Edge coloring Discrete mathematics Planar graph Greedy coloring Complete coloring Indifference graph Pathwidth Upper and lower bounds 1-planar graph Graph Line graph Graph power
Metrics
86
Cited By
2.64
FWCI (Field Weighted Citation Impact)
6
Refs
0.90
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
Limits and Structures in Graph Theory
Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics
Graph Labeling and Dimension Problems
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
JOURNAL ARTICLE
A simple competitive graph coloring algorithm III
Charles L. DunnH. A. Kierstead
Journal: Journal of Combinatorial Theory Series B Year: 2004 Vol: 92 (1)Pages: 137-150
JOURNAL ARTICLE
A simple competitive graph coloring algorithm II
Charles L. DunnH. A. Kierstead
Journal: Journal of Combinatorial Theory Series B Year: 2003 Vol: 90 (1)Pages: 93-106
JOURNAL ARTICLE
Algorithm for coloring edges of a simple graph
Journal: Daghestan Electronic Mathematical Reports Year: 2016 Pages: 25-30
JOURNAL ARTICLE
Simple decentralized graph coloring
Journal: Computational Optimization and Applications Year: 2016 Vol: 66 (1)Pages: 163-185
BOOK-CHAPTER
Introduction to Competitive Graph Coloring
Charles L. DunnVictor LarsenJennifer Firkins Nordstrom
Foundations for undergraduate research in mathematics Year: 2017 Pages: 99-126