On the equality of the partial Grundy and upper ochromatic numbers of graphs

2003/09/16 by Paul Erdös, Paul Erdős, Stephen T. Hedetniemi +4 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Complete coloring #Discrete mathematics #Edge coloring #Fractional coloring #Graph #Graph Labeling and Dimension Problems #Graph power #Greedy coloring #Limits and Structures in Graph Theory #Line graph #List coloring #Mathematics #Partition (number theory) #Vertex (graph theory)

paper · pdf · doi:10.1016/s0012-365x(03)00184-5

openalex publication_date 2003/09/16 · crossref created 2003/09/16 · crossref issued 2003/10/01 · crossref published 2003/10/01 · crossref published-print 2003/10/01 · crossref deposited 2019/02/24 · openalex created_date 2025/10/10 · crossref indexed 2025/12/31 · openalex updated_date 2026/08/03

Citations

• Some perfect coloring properties of graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• An upper bound for the chromatic number of a graph and its application to timetabling problems

Cited by

• Grundy number [wikipedia]