| 000 | 00868nam a2200181Ia 4500 | ||
|---|---|---|---|
| 008 | 140223b1995 xxu||||| |||| 00| 0 eng d | ||
| 020 |
_a9780471595045 _c0.00 |
||
| 082 |
_a511.6 _bTUC |
||
| 100 | _aTucker, Alan | ||
| 245 | _aApplied Combinatorics | ||
| 250 | _a3rd ed | ||
| 260 |
_aNew York _bJohn Wiley & Sons, Inc. _c1995 |
||
| 300 | _a462p | ||
| 500 | _aElements of Graph Theory Covering Circuits and Graph Coloring Trees and Searching Network Algorithms Generating Counting Methods for Selections and Arrangements Generating Functions Recurrence Relations Inclusion-Exclusion Polya's Enumeration Formula Games with Graphs | ||
| 890 | _aUSA | ||
| 891 | _aScience & Technology - Maths {QuickPic} | ||
| 995 |
_ATUC _C- _D0.00 _E0 _F049 _G363 _H0 _I0.00 _J _UC _W19981113 _XP.B.C. Book Service _ZReference |
||
| 999 |
_c44366 _d44366 |
||