Coloring 3-Chromatic Graphs

Bernd Gärtner () and Jiří Matoušek ()
Additional contact information
Bernd Gärtner: ETH Zurich, Institute of Theoretical Computer Science
Jiří Matoušek: Charles University, Department of Applied Mathematics

Chapter Chapter 9 in Approximation Algorithms and Semidefinite Programming, 2012, pp 157-166 from Springer

Abstract: Abstract The chromatic number χ(G), the smallest number of colors needed to color the vertices of a graph G so that no two neighboring vertices receive the same color. The independence number a(G), the size of the largest independent set in G, where an independent set is one with no two of its vertices connected by an edge.

Keywords: Chromatic Number; Independence Number; Coloring Algorithm; Unique Game Conjecture; Rado Theorem (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-22015-9_9

Ordering information: This item can be ordered from
http://www.springer.com/9783642220159

DOI: 10.1007/978-3-642-22015-9_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().