Vetenskap & teknik
Chromatic Polynomials And Chromaticity Of Graphs
Fengming Dong • Khee-Meng Koh • Kee L Teo
Inbunden
2709:-
Tillfälligt slut online – klicka på "Bevaka" för att få ett mejl så fort varan går att köpa igen.
Andra format:
- Pocket/Paperback 1469:-
This is the first book to comprehensively cover chromatic polynomials of graphs. It includes most of the known results and unsolved problems in the area of chromatic polynomials. Dividing the book into three main parts, the authors take readers from the rudiments of chromatic polynomials to more complex topics: the chromatic equivalence classes of graphs and the zeros and inequalities of chromatic polynomials. The early material is well suited to a graduate level course while the latter parts will be an invaluable resource for postgraduate students and researchers in combinatorics and graph theory.
- Format: Inbunden
- ISBN: 9789812563170
- Språk: Engelska
- Antal sidor: 384
- Utgivningsdatum: 2005-06-01
- Förlag: World Scientific Publishing Co Pte Ltd