Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
Previous work on competition graphs has emphasized characterization, not only of the competition graphs themselves but also of those graphs whose competition graphs are chordal or interval. The latter sort of characterization is of interest when a competition graph that is easily colorable would be useful, e.g. in a scheduling or assignment problem. This leads naturally to the following question: Given a graph F, does the structure of G tell us anything about the chromatic number X of the competition graph C(G)? We show that in some cases we can calculate this chromatic number exactly, while in others we can place tight bounds on the chromatic number. Competition graphs, Graph coloring.
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
Previews available in: English
Subjects
GRAPHS, CHROMATICITY, COMPETITIONEdition | Availability |
---|---|
1
Chromatic numbers of competition graphs
1993, Naval Postgraduate School, Available from National Technical Information Service
in English
|
aaaa
|
Book Details
Edition Notes
Cover title.
"NPS-MA-93-020."
"Technical report for period April 1993 - July 1993."
AD A275 520.
Includes bibliographical references (p. 10-11)
aq/ /aq cc:9116 09/12/97
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?July 27, 2014 | Created by ImportBot | import new book |