000			02161cam a2200433 a 4500
001			16374533
003			RPAM
005			20160624102329.0
006			ma b 001 0
007			cr/|||||||||||
008			140928s2010 riua ob 001 0 eng
020			_a9781470405953 (online)
040			_aDLC _cDLC _dYDX _dYDXCP _dIOG _dDLC _dRPAM
050	0	0	_aQA3 _b.A57 no. 981 _aQA166.6
082	0	0	_a511/.6 _222
100	1		_aMayhew, Dillon, _d1976-
245	1	4	_aThe internally 4-connected binary matroids with no M(K3,3)-minor / _h[electronic resource] _cDillon Mayhew, Gordon Royle, Geoff Whittle.
260			_aProvidence, R.I. : _bAmerican Mathematical Society, _c2010.
300			_a1 online resource (v, 95 p. : ill.)
490	0		_aMemoirs of the American Mathematical Society, _x0065-9266 (print); _x1947-6221 (online); _vv. 981
504			_aIncludes bibliographical references and index.
500			_a"Volume 208, number 981 (end of volume )."
500			_a"November 2010."
505	0	0	_tChapter 1. Introduction _tChapter 2. Preliminaries _tChapter 3. M�obius matroids _tChapter 4. From internal to vertical connectivity _tChapter 5. An $R_$-type matroid _tChapter 6. A connectivity lemma _tChapter 7. Proof of the main result _tAppendix A. Case-checking _tAppendix B. Sporadic matroids _tAppendix C. Allowable triangles
506	1		_aAccess is restricted to licensed institutions
533			_aElectronic reproduction. _bProvidence, Rhode Island : _cAmerican Mathematical Society. _d2012
538			_aMode of access : World Wide Web
588			_aDescription based on print version record.
650		0	_aMatroids.
650		0	_aDecomposition method.
650		0	_aCombinatorial designs and configurations.
700	1		_aRoyle, Gordon.
700	1		_aWhittle, Geoff, _d1950-
776	0		_iPrint version: _aMayhew, Dillon, 1976- _tinternally 4-connected binary matroids with no M(K3,3)-minor / _w(DLC) 2010030204 _x0065-9266 _z9780821848265
786			_dAmerican mathematical Society
856	4		_3Contents _uhttp://www.ams.org/memo/0981
856	4		_3Contents _uhttp://dx.doi.org/10.1090/S0065-9266-10-00600-9
942			_2EBK13434 _cEBK
999			_c42728 _d42728