Skip to search formSkip to main contentSkip to account menu

Greedy coloring

In the study of graph coloring problems in mathematics and computer science, a greedy coloring is a coloring of the vertices of a graph formed by a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

26 relations
Albertson conjectureAndrás HajnalBrooks' theoremClaw-free graph

Broader (1)

Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Ordering heuristics for parallel graph coloring
This paper introduces the largest-log-degree-first (LLF) and smallest-log-degree-last (SLL) ordering heuristics for parallel… 
2014
2014
Recoloring graphs via tree decompositions
2014
2014
Fast Triangle Core Decomposition for Mining Large Graphs
Large triangle cores represent dense subgraphs for which each edge has at least k − 2 triangles (same as cliques). This paper… 
2013
2013
Multipass greedy coloring of simple uniform hypergraphs
  • J. Kozik
  • Random Struct. Algorithms
  • 2013
  • Corpus ID: 14373041
Let m*(n) be the minimum number of edges in an n‐uniform simple hypergraph that is not two colorable. We prove that m*(n)=Ω(4n… 
2013
2013
Recoloring bounded treewidth graphs
2010
2010
Time Slot Assignment Algorithms in IEEE 802.16 Multi-hop Relay Networks
In this paper, we propose an assignment algorithm of time slots for wireless links in IEEE 802.16 multi-hop relay networks. The… 
2010
2010
Scheduling for MIMO Networks with Rate-Constrained Connectivity Requirements
In this paper, we present a novel definition of connectivity for ad hoc networks, and based on this definition, we propose a… 
2010
2010
A Genetic Algorithm to Minimize Chromatic Entropy
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to… 
2010
2010
Algorithmic Aspects of Communications in Multihop Wireless Networks with MIMO Links
MIMO links enable concurrent transmissions of multiple independent data streams between a pair of nodes, which can significantly… 
Highly Cited
2006
Highly Cited
2006
Results on the Grundy chromatic number of graphs
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)