Skip to search formSkip to main contentSkip to account menu

Graph coloring

Known as: Graph coloring algorithm, Mycielski's theorem, K-coloring 
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
B-coloringBranch and boundBranch and priceBreadth-first search

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Agreement Reflexes of Emerging Optionality in Heritage Speaker Spanish.
2011
2011
On uniqueness problems related to elliptic equations for measures
We consider equations of the form L*μ = 0 for bounded measures on $$ {\mathbb{R}^{d}} $$, where L is a second order elliptic… 
2010
2010
DDRC: Data Dissemination in Vehicular Networks Using Rateless Codes
In this paper, we address the problem of delivering multimedia content to a sparse vehicular network from roadside info-stations… 
Highly Cited
2008
Highly Cited
2008
Creating the Color Panoramic View using Medley of Grayscale and Color Partial Images
— Panoramic view generation ha s always offered novel and distinct challenges in the field of image processing. Panoramic view… 
2008
2008
Improving the Color Stability of Wood-Plastic Composites Through Fiber Pre-Treatment
Wood-plastic composites (WPCs) continue to make inroads into the decking market. One of the main drawbacks from the consumer's… 
2004
2004
Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks
We present the first distributed algorithms for computing connected dominating sets (CDS) for ad hoc networks that break the… 
1994
1994
A Fast Selection Algorithm for Meshes with Multiple Broadcasting
One of the fundamental algorithmic problems in computer science involves selecting the kth smallest element in a collection A of… 
1993
1993
The star chromatic number of a graph
We study a generalization of the notion of the chromatic number of a graph in which the colors assigned to adjacent vertices are… 
1990
1990
A Timetabling Problem in which Clashes are Inevitable
This paper is concerned with a university timetabling problem in which some clashes are unavoidable if the weekly lecture… 
Review
1965
Review
1965
Mouth Color of Nestling Passerines and Its Use in Taxonomy
M OUTH color has received little attention as a taxonomic character although tongue and palatal markings of nestlings have proved… 
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)