LEADER 00000cam a2200625Ia 4500 
001    ocm70259023  
003    OCoLC 
005    20160527041837.7 
006    m     o  d         
007    cr cnu---unuuu 
008    060707s2005    si a    ob    001 0 eng d 
019    144523764|a475976231|a815743967|a888591530|a935232530 
020    9812569464|q(electronic book) 
020    9789812569462|q(electronic book) 
020    1281881090 
020    9781281881090 
035    (OCoLC)70259023|z(OCoLC)144523764|z(OCoLC)475976231
       |z(OCoLC)815743967|z(OCoLC)888591530|z(OCoLC)935232530 
040    N$T|beng|epn|cN$T|dYDXCP|dOCLCQ|dOCLCG|dOCLCQ|dIDEBK
       |dOCLCQ|dMERUC|dOCLCQ|dHVC|dOCLCO|dOCLCF|dNLGGC|dOCLCQ
       |dEBLCP|dMHW|dDEBSZ|dOCLCQ 
049    RIDW 
050  4 QA166.247|b.D66 2005eb 
072  7 MAT|x013000|2bisacsh 
072  7 PHH|2bicssc 
082 04 511/.56|222 
090    QA166.247|b.D66 2005eb 
100 1  Dong, F. M.,|d1962-|0https://id.loc.gov/authorities/names/
       no2006039536 
245 10 Chromatic polynomials and chromaticity of graphs /|cF.M. 
       Dong, K.M. Koh and K.L. Teo. 
264  1 Singapore :|bWorld Scientific Pub.,|c2005. 
300    1 online resource (xxvii, 356 pages) :|billustrations 
336    text|btxt|2rdacontent 
337    computer|bc|2rdamedia 
338    online resource|bcr|2rdacarrier 
340    |gpolychrome|2rdacc 
347    text file|2rdaft 
504    Includes bibliographical references (pages 327-352) and 
       index. 
505 0  Preface; Contents; Basic Concepts in Graph Theory; 
       Notation; Chapter 1 The Number of -Colourings and Its 
       Enumerations; Chapter 2 Chromatic Polynomials; Chapter 3 
       Chromatic Equivalence of Graphs; Chapter 4 Chromaticity of
       Multi-Partite Graphs; Chapter 5 Chromaticity of 
       Subdivisions of Graphs; Chapter 6 Graphs in Which any Two 
       Colour Classes Induce a Tree (I); Chapter 7 Graphs in 
       Which any Two Colour Classes Induce a Tree (II); Chapter 8
       Graphs in Which All but One Pair of Colour Classes Induce 
       Trees (I); Chapter 9 Graphs in Which All but One Pair of 
       Colour Classes Induce Trees (II). 
520    This is the first book to comprehensively cover chromatic 
       polynomialsof graphs. It includes most of the known 
       results and unsolved problemsin the area of chromatic 
       polynomials. Dividing the book into threemain parts, the 
       authors take readers from the rudiments of 
       chromaticpolynomials to more complex topics: the chromatic
       equivalence classesof graphs and the zeros and 
       inequalities of chromatic polynomials. 
588 0  Print version record. 
590    eBooks on EBSCOhost|bEBSCO eBook Subscription Academic 
       Collection - North America 
650  0 Graph coloring.|0https://id.loc.gov/authorities/subjects/
       sh2004000285 
650  0 Graph theory.|0https://id.loc.gov/authorities/subjects/
       sh85056471 
650  0 Polynomials.|0https://id.loc.gov/authorities/subjects/
       sh85104702 
650  7 Graph coloring.|2fast|0https://id.worldcat.org/fast/
       1200543 
650  7 Graph theory.|2fast|0https://id.worldcat.org/fast/946584 
650  7 Polynomials.|2fast|0https://id.worldcat.org/fast/1070715 
655  4 Electronic books. 
700 1  Koh, K. M.|q(Khee Meng),|d1944-|0https://id.loc.gov/
       authorities/names/n78047488 
700 1  Teo, K. L.|0https://id.loc.gov/authorities/names/n81051843
776 08 |iPrint version:|aDong, F.M.|tChromatic polynomials and 
       chromaticity of graphs.|dSingapore : World Scientific Pub.,
       2005|z9812563830|z9812563172|w(DLC)  2006295259
       |w(OCoLC)61262731 
856 40 |uhttps://rider.idm.oclc.org/login?url=http://
       search.ebscohost.com/login.aspx?direct=true&scope=site&
       db=nlebk&AN=161370|zOnline eBook. Access restricted to 
       current Rider University students, faculty, and staff. 
856 42 |3Instructions for reading/downloading this eBook|uhttp://
       guides.rider.edu/ebooks/ebsco 
901    MARCIVE 20231220 
948    |d20160615|cEBSCO|tebscoebooksacademic|lridw 
994    92|bRID