000 | 01932nam a2200409Ia 4500 | ||
---|---|---|---|
001 | EBC256682 | ||
003 | MiAaPQ | ||
005 | 20240120130009.0 | ||
006 | m o d | | ||
007 | cr cn||||||||| | ||
008 | 040602s2004 enka sb 001 0 eng d | ||
010 | _z 2004300266 | ||
020 | _z0511187459 | ||
020 | _z0521827582 | ||
035 | _a(MiAaPQ)EBC256682 | ||
035 | _a(Au-PeEL)EBL256682 | ||
035 | _a(CaPaEBR)ebr10124740 | ||
035 | _a(CaONFJC)MIL44950 | ||
035 | _a(OCoLC)319033335 | ||
040 |
_aMiAaPQ _cMiAaPQ _dMiAaPQ |
||
050 | 4 |
_aQA166 _b.G645 2004 |
|
100 | 1 | _aGolumbic, Martin Charles. | |
245 | 1 | 0 |
_aTolerance graphs _h[electronic resource] / _cMartin Charles Golumbic, Ann N. Trenk. |
260 |
_aCambridge, UK ; _aNew York : _bCambridge University Press, _c2004. |
||
300 |
_axii, 265 p. : _bill. |
||
490 | 1 |
_aCambridge studies in advanced mathematics ; _v89 |
|
504 | _aIncludes bibliographical references (p. 253-259) and indexes. | ||
505 | 0 | _aIntroduction -- Early work on tolerance graphs -- Trees, cotrees and bipartite graphs -- Interval probe graphs -- Bitolerance graphs and ordered sets -- Unit and 50% tolerance graphs -- Comparability and invariance results -- Bounded bitolerance recognition -- Algorithms on tolerance graphs -- The hierarchy of bitolerance orders -- Tolerance models on trees -- Phi-tolerance models -- Directed tolerance graphs -- Open questions and further directions. | |
533 | _aElectronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries. | ||
650 | 0 | _aGraph theory. | |
650 | 0 | _aCombinatorial analysis. | |
655 | 4 | _aElectronic books. | |
700 | 1 | _aTrenk, Ann N. | |
710 | 2 | _aProQuest (Firm) | |
830 | 0 |
_aCambridge studies in advanced mathematics ; _v89. |
|
856 | 4 | 0 |
_uhttps://ebookcentral.proquest.com/lib/bacm-ebooks/detail.action?docID=256682 _zClick to View |
999 |
_c24005 _d24005 |