The Graph Coloring Problem: A Bibliographic Survey

Panos M. Pardalos (), Thelma Mavridou and Jue Xue ()
Additional contact information
Panos M. Pardalos: University of Florida, Center for Applied Optimization, ISE Department
Thelma Mavridou: University of Florida, Center for Applied Optimization, ISE Department
Jue Xue: The City University of Hong Kong, Department of Management Sciences

A chapter in Handbook of Combinatorial Optimization, 1998, pp 1077-1141 from Springer

Abstract: Abstract In this chapter G = (V,E) denotes an arbitrary undirected graph without loops, where V = {v 1, v 2,…, v n } is its vertex set and E = {e 1,e 2,…, e m } ⊂ (E ×E) is its edge set. Two edges are adjacent if they connect to a common vertex. Two vertices v i and v j are adjacent if there is an edge e = (v i ,v j ) ∈ E. Finally, if e = (v i ,v j ) ∈ E,we say e is incident to vertices v i , v j .

Keywords: Random Graph; Chromatic Number; Discrete Mathematic; Graph Coloring; Coloring Problem (search for similar items in EconPapers)
Date: 1998
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-1-4613-0303-9_16

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

DOI: 10.1007/978-1-4613-0303-9_16

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 ().