000			01461nam a22004455i 4500
001			978-1-84628-970-5
003			DE-He213
005			20130515021146.0
007			cr nn 008mamaa
008			100301s2008 xxk| s |||| 0|eng d
020			_a9781846289705 _9978-1-84628-970-5
024	7		_a10.1007/978-1-84628-970-5 _2doi
100	1		_aBondy, J. A.
245	1	0	_aGraph Theory _h[electronic resource] / _cby J. A. Bondy, U. S. R. Murty.
260			_aLondon : _bSpringer London, _c2008.
300			_bdigital.
490	0		_aGraduate Texts in Mathematics, _x0072-5285 ; _v244
650		0	_aMathematics.
650		0	_aComputer science.
650		0	_aComputational complexity.
650		0	_aAlgorithms.
650		0	_aCombinatorics.
650		0	_aMathematical optimization.
650		0	_aOperations research.
650	1	4	_aMathematics.
650	2	4	_aCombinatorics.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aAlgorithms.
650	2	4	_aOptimization.
650	2	4	_aMathematics of Computing.
650	2	4	_aOperations Research, Mathematical Programming.
700	1		_aMurty, U. S. R.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9781846289699
830		0	_aGraduate Texts in Mathematics, _x0072-5285 ; _v244
856	4	0	_uhttp://dx.doi.org/10.1007/978-1-84628-970-5
912			_aZDB-2-SMA
999			_c74418 _d74418