000			01793cam a2200373Ia 4500
001			10539997
003			BD-DhUL
005			20140813161443.0
008			140812s19641962enka b 001 0 eng d
029	1		_aNZ1 _b12940747
029	1		_aHEBIS _b129949493
029	1		_aDEBBG _bBV002117014
035			_a(OCoLC)ocm09764229
035			_a(OCoLC)9764229 _z(OCoLC)16386276
035			_a(NNC)10539997
040			_aMYG _beng _cMYG _dOCL _dDEBBG _dILU _dOCLCQ _dBD-DhUL
041	1		_aeng _hfre
050		4	_aQA611.B495 _bT39 1964
082	0	4	_a311.26 _bBET
084			_aQH 451 _2rvk
084			_aSK 890 _2rvk
100	1		_aBerge, Claude.
240	1	0	_aThéorie des graphes et ses applications. _lEnglish
245	1	4	_aThe theory of graphs and its applications / _cby Claude Berge ; translated by Alison Doig.
260			_aLondon : _bMethuen ; _aNew York : _bWiley, _c1964, c1962.
300			_ax, 247 p. : _bill. ; _c24 cm.
500			_aIncludes index
501			_aBibliography: p. 238-244
505	0		_a1. General definitions -- 2. Descendance relations -- 3. The ordinal function and the Grundy function on an infinite graph -- 4. The fundamental numbers of the theory of graphs -- 5. Kernels of a graph -- 6. Games on a graph -- 7. The problem of the shortest route -- 8. Transport networks -- 9. The theorem of the demi-degrees -- 10. Matching of a simple graph -- 11. Factors -- 12. Centres of a graph -- 13. The diameter of a strongly connected craph -- 14. The matrix associated with a graph -- 15. Incidence matrices -- 16. Trees and arborescences -- 17. Euler's problem -- 18. Matching in the general case -- 19. Semi-factors -- 20. The connectivity of a graph -- 21. Planar graphs.
650		0	_aGraph theory.
650		0	_aSet theory.
900			_aAUTH
942			_2ddc _cBK
999			_c2599 _d2599