Show simple item record

dc.contributor.authorLundgren, J. Richard
dc.contributor.authorMerz, Sarah K.
dc.contributor.authorRasmussen, Craig W.
dc.date.accessioned2014-09-02T16:57:32Z
dc.date.available2014-09-02T16:57:32Z
dc.date.issued1995
dc.identifier.citationLinear Algebra and Its Applications, v. 217, 1995, pp. 225-239.
dc.identifier.urihttp://hdl.handle.net/10945/43175
dc.description.abstractPrevious 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 G, 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 it.en_US
dc.publisherNorth-Hollanden_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.en_US
dc.titleChromatic numbers of competition graphsen_US
dc.typeArticleen_US
dc.contributor.corporateNaval Postgraduate School
dc.contributor.departmentMathematics


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record