000			02315nam a22004575i 4500
001			978-3-540-49301-3
003			DE-He213
005			20160624101831.0
007			cr nn 008mamaa
008			121227s1996 gw | s |||| 0|eng d
020			_a9783540493013 _9978-3-540-49301-3
024	7		_a10.1007/BFb0092895 _2doi
050		4	_aQA164-167.2
072		7	_aPBV _2bicssc
072		7	_aMAT036000 _2bisacsh
082	0	4	_a511.6 _223
100	1		_aYap, Hian-Poh. _eauthor.
245	1	0	_aTotal Colourings of Graphs _h[electronic resource] / _cby Hian-Poh Yap.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1996.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1996.
300			_aVIII, 140 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Mathematics, _x0075-8434 ; _v1623
505	0		_aBasic terminology and introduction -- Some basic results -- Complete r-partite graphs -- Graphs of low degree -- Graphs of high degree -- Classification of type 1 and type 2 graphs -- Total chromatic number of planar graphs -- Some upper bounds for the total chromatic number of graphs -- Concluding remarks.
520			_aThis book provides an up-to-date and rapid introduction to an important and currently active topic in graph theory. The author leads the reader to the forefront of research in this area. Complete and easily readable proofs of all the main theorems, together with numerous examples, exercises and open problems are given. The book is suitable for use as a textbook or as seminar material for advanced undergraduate and graduate students. The references are comprehensive and so it will also be useful for researchers as a handbook.
650		0	_aMathematics.
650		0	_aCombinatorics.
650	1	4	_aMathematics.
650	2	4	_aCombinatorics.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540607175
786			_dSpringer
830		0	_aLecture Notes in Mathematics, _x0075-8434 ; _v1623
856	4	0	_uhttp://dx.doi.org/10.1007/BFb0092895
942			_2EBK1744 _cEBK
999			_c31038 _d31038