Diestel R. — Graph Theory :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

Diestel R. — Graph Theory

Обсудите книгу на научном форуме

Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter

Название: Graph Theory

Автор: Diestel R.

Аннотация:

Graph Theory can be used both as a reliable textbook for an introductory course and as a graduate text: on each topic it covers all the basic material in full detail, and adds one or two deeper results (again with detailed proofs) to illustrate the more advanced methods of that field.

Язык:

Рубрика: Математика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Издание: 2-nd edition

Год издания: 2000

Количество страниц: 322

Добавлена в каталог: 10.02.2013

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

Theory      145
Thomas, R.      121 183 208 210 258 280
Thomason, A.G.      66 170 179 186 241
Thomassen, C.      65 92 106 121 179 185 187 228 281 282
Three colour theorem      97
Three-flow conjecture      141
Threshold function      241—247 250
Threshold function for      247
Threshold function for well-quasi-ordering of trees      253—254
Toft, B.      120 146
Topological isomorphism      76 78 88
Topological minor      17 18
Torso      279
Total chromatic number      119
Total colouring      119
Total value of a flow      126
Touching sets      258
Tournament      227
Transitive graph      41
Travelling salesman problem      227
TREE      12 14
Tree (induced)      178
Tree (induced) and WQO of general graphs      278
Tree (induced) and WQO of trees      253
Tree as forced substructure      13 178 185
Tree, cover      61
Tree, normal      13—14 27 139 144 296
Tree-decomposition      186 255—262 278 280—281
Tree-decomposition, induced on minors      256
Tree-decomposition, induced on subgraphs      256
Tree-decomposition, lean      261
Tree-decomposition, obstructions      258—260 264—265 280 281
Tree-decomposition, part of      255
Tree-decomposition, simplicial      261 275 279 281
Tree-decomposition, width of      257
Tree-order      13
Tree-width      257—274
Tree-width and brambles      258—260 278 281
Tree-width and forbidden minors      263—274
Tree-width of a minor      257
Tree-width of a subdivision      278
Tree-width of grid      260 278 281
Tree-width, duality theorem      258—260
Tree-width, obstructions to small      258—260 264— 265 280 281
triangle      3

Triangulated      (see Chordal)
Triangulation      (see Plane triangulation)
Trivial graph      2
Trotter, W.T.      194
Turan, P.      150
Tutte polynomial      146
Tutte, W.T.      35 46 47 58 65 66 86 92 128 131 139 145 146 215 228
Tychonov, A.N.      210
Unbalanced subgraph      247 249
Uniformity lemma      (see Regularity lemma)
union      3
Unmatched      29
Upper density      166
Urquhart, A.      121
Valency (degree)      5
Value of a flow      126
Variance      242
Vertex      2
Vertex of a plane graph      70
Vertex, colouring      95 98—103
Vertex, cover      30
Vertex, cut      (see Separating set)
Vertex, space      20
Vertex-chromatic number      95
Vertex-connectivity      10
Vertex-transitive      41
Vince, A.      249
Vizing, V.G.      103 121 122 289 290 293
Voigt, M.      121
Wagner graph      183 261—262 279
Wagner, K.      84 93 183 184 185 186 281
Wagner’s conjecture      281
Walk      9
Walk, alternating      52
Walk, closed      9
Walk, length      9
Well-ordering      294
Well-quasi-ordering      251 282
Welsh, D.J.A.      146
Wheel      46
Wheel, theorem      46 65
Whitney, H.      66 80 89
Width of tree-decomposition      257
Winkler, P.      249
Zykov, A.A.      166

1 2 3 4

О проекте