000			02094nam a22003618a 4500
001			CR9780511863158
003			UkCbUP
005			20160624102300.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			101111s2012||||enk s ||1 0|eng|d
020			_a9780511863158 (ebook)
020			_z9780521282352 (paperback)
040			_aUkCbUP _cUkCbUP _erda
050	0	0	_aQA166 _b.Z528 2012
082	0	0	_a511.5 _223
100	1		_aZhang, Cun-Quan, _eauthor.
245	1	0	_aCircuit Double Cover of Graphs / _cCun-Quan Zhang.
260		1	_aCambridge : _bCambridge University Press, _c2012.
264		1	_aCambridge : _bCambridge University Press, _c2012.
300			_a1 online resource (375 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	0		_aLondon Mathematical Society Lecture Note Series ; _vno. 399
500			_aTitle from publisher's bibliographic system (viewed on 16 Oct 2015).
520			_aThe famous Circuit Double Cover conjecture (and its numerous variants) is considered one of the major open problems in graph theory owing to its close relationship with topological graph theory, integer flow theory, graph coloring and the structure of snarks. It is easy to state: every 2-connected graph has a family of circuits covering every edge precisely twice. C.-Q. Zhang provides an up-to-date overview of the subject containing all of the techniques, methods and results developed to help solve the conjecture since the first publication of the subject in the 1940s. It is a useful survey for researchers already working on the problem and a fitting introduction for those just entering the field. The end-of-chapter exercises have been designed to challenge readers at every level and hints are provided in an appendix.
776	0	8	_iPrint version: _z9780521282352
786			_dCambridge
830		0	_aLondon Mathematical Society Lecture Note Series ; _vno. 399.
856	4	0	_uhttp://dx.doi.org/10.1017/CBO9780511863158
942			_2EBK12178 _cEBK
999			_c41472 _d41472