| 000 | 00704nam a2200181Ia 4500 | ||
|---|---|---|---|
| 003 | OSt | ||
| 005 | 20240213141315.0 | ||
| 008 | 210324s2015 xx 000 0 und d | ||
| 040 | _cNIL | ||
| 082 |
_a510 _bGOO-PAR |
||
| 100 |
_aGoodaire, E.G. _9422306 |
||
| 245 | _aDiscrete Mathematics with Graph Theory | ||
| 260 | _c2015 | ||
| 520 | _aContents Yes, there are proofs Logic Sets and relations Functions Integers Induction and Recursion Principles of counting Permutations and Combinations Algorithms Graphs paths and circuits Trees Planar Graphs and colorings Max flow -Mini cut Theorem | ||
| 650 |
_aMathematics _9422307 |
||
| 700 |
_aParmenter, M.M. _9422308 |
||
| 942 |
_2ddc _cBK |
||
| 999 |
_c308002 _d308002 |
||