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

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

blank
blank
blank
Красота
blank
Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1)
Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1)

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

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



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


Название: Handbook of combinatorics (vol. 1)

Авторы: Graham R.L., Grotschel M., Lovasz L.

Аннотация:

Combinatorics research, the branch of mathematics that deals with the study of discrete, usually finite, structures, covers a wide range of problems not only in mathematics but also in the biological sciences, engineering, and computer science. The Handbook of Combinatorics brings together almost every aspect of this enormous field and is destined to become a classic. Ronald L. Graham, Martin Grotschel, and Laszlo Lovasz, three of the world's leading combinatorialists, have compiled a selection of articles that cover combinatorics in graph theory, theoretical computer science, optimization, and convexity theory, plus applications in operations research, electrical engineering, statistical mechanics, chemistry, molecular biology, pure mathematics, and computer science.
The 20 articles in Volume 1 deal with structures while the 24 articles in Volume 2 focus on aspects, tools, applications, and horizons.


Язык: en

Рубрика: Математика/Алгебра/Комбинаторика/

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Graph $\chi$-critical      48
Graph $\Gamma$-contraclible      217
Graph $\lambda$ by $\lambda$ half-bipartite      2105
Graph 1-cxtendable      195
Graph 2-arc-transitive      1469
Graph 2-bicritical      218
Graph 2-connected      117 493
Graph 2-regular      1165
Graph 3-colorable      246
Graph 3-connected      151
Graph 3-connected planar      891
Graph acyclic      10
Graph adjacent faces of a planar      55
Graph adjacent vertices of      5
Graph algorithms      2187
Graph antipodal      1505
Graph arc-transitive      1454 1455 1503—1507
Graph asymmetric      1461
Graph automorphism of      64 1363
Graph balanced      362
Graph balanced bipartite      6
Graph basis      1831
Graph bicritical      19S
Graph bidirected      214
Graph binomial random      353
Graph bipartite      6 14 386 397 407 947
Graph bipartite incidence      421
Graph bridge      587
Graph Catlin      256
Graph Cayley      64 1467—1469 1473 1478 1482—1484 1486 1493 1494 1497 1500 1752—1754 1756 1757
Graph Chang      768
Graph chemical      1957
Graph chordal      117 329 399
Graph circuit extendable      78
Graph claw-free      66 183 225
Graph Clebsch      701 1454
Graph closure of      23 1257
Graph color-critical      236 239 242—244 250 253—256 262
Graph coloring number of      250 2104
Graph coloring problem      1892
Graph comparability      266 443
Graph complete      5 1268 2176
Graph complete bipartite      6
Graph component of      9
Graph composition of      43
Graph conference      753
Graph connected      9 489
Graph connected labeled      1041 1114
Graph connectivity      1958
Graph contraction-critical      257 262
Graph convex representation of      310
Graph coprime      1011 1012
Graph covering      1455 1469
Graph Coxeter      52 54 64 1452 1472
Graph critical      156 196 2179
Graph critically imperfect      268 269
Graph cube of      53
Graph cubic      59 1965
Graph current      325
Graph d-interval      312
Graph d-polytopal      879 905—907
Graph d-regular      7
Graph dependency      1798
Graph diameter of      10
Graph dimension of      842
Graph directed      15
Graph distance-regular      760 1506 1507
Graph distance-transitive      629 766 1452 1455 1505 1506
Graph divisor      1012
Graph doubly periodic      311
Graph dual      259 308
Graph dual polar      768
Graph edge-critical      272
Graph edge-weighted      14
Graph embedding      1970
Graph embedding of      303
Graph empty      6
Graph end of      1480
Graph Erdos-Renyi      1242
Graph Eulerian      65 163 2076 2176
Graph even      7 9
Graph evolving      354
Graph extremal      12 1167 1233
Graph factor critical      196
Graph finite      5
Graph first-order theory of      364
Graph forbidden      1233
Graph generalized line      1734
Graph genus of      320
Graph geometric      684
Graph Gewirtz      701
Graph Grinberg      57
Graph Hajos consmictible      252
Graph Hamiltoman      20 2176
Graph Hamming      1463
Graph Heawood      19 63 64 1452
Graph hexagonal animal      1973
Graph Higman — Sims      701 729
Graph Hoflrnan — Singleton      752 760
Graph homogeneous      1507 1508
Graph homornorphism      276
Graph hypo-Hamiltonian      54
Graph hypomatchable      196
Graph hypotraccable      54
Graph incidence      18 386 421 674
Graph infinite      5 2179
Graph interaction      1949
Graph intersection      387
Graph interval      266 1994
Graph invariants      1957 1973
Graph isomorphism      1511 1516 1518
Graph isomorphism classes of      1060
Graph isomorphism problem      1619 1631
Graph isospectral      1456
Graph joined vertices of      5
Graph k-chromatic      48
Graph k-colorable      48 246
Graph k-extendable      195
Graph Kneser      64 240 764 1455 1825
Graph Konig — Egervary      219
Graph Kuratowski      6
Graph Levi      64 76 1449
Graph lexicographic product of      43
Graph line      65 183 274 387 392 1455 1456 1734 2053
Graph locally connected      66
Graph locally finite      1477
Graph locally planar      262
Graph LSG      see “Latin square”
Graph map      1826
Graph Margulis      1265
Graph matching covered      195
Graph maximal non-Hamiltonian      1275
Graph metrically k-transitive      1508
Graph minimal forbidden unit-distance      844
Graph minor of      304
Graph molecular      1957
Graph Moore      63 760 1264
Graph non-isomorphism problem      163]
Graph of groups      1495
Graph order of      5
Graph oriented      15
Graph outerplanar      308
Graph overlap      58
Graph packing      1276
Graph Paley      1760 1761
Graph panconnected      78
Graph pancyclic      24 25
Graph partition of      43 1830
Graph path partition of      43
Graph path-tough      53
Graph perfect      182 265—267 269 270 1546 1591 1687
Graph Petersen      51 54 62—64 75 89 92 189 211 295 296 377 515 548 701 750 752 760 1452 1472
Graph planar      55 153 237 259 277 306 494 1458 1511 1564 2078
Graph plane      55 306
Graph Platonic      5
Graph point      684
Graph polynomial      252 1772
Graph power of      52
Graph process      354
Graph process random      354
Graph product Cartesian      1463
Graph product categorical      1463
Graph product lexicographic      1463
Graph product strong      1463
Graph property      354 355
Graph property of      1253 1284
Graph pseudo-geometnc      684
Graph pseudo-random      1758 1760
Graph quasi-random      376
Graph quotient      1461
Graph Rado      1463 1474 1508
Graph Ramsey      384 418 419 1464
Graph random      353 1350 1461 1932
Graph rank      3 766
Graph reaction      1957 1958
Graph realization (GR)      592
Graph reconstruction      1730
Graph rectangular representation of      312
Graph regular      7
Graph representative      387
Graph ridge      905
Graph rigid      1461
Graph rigid-circuit      266 267
Graph rooted      891
Graph s-arc transitive      629
Graph Sachs      1973
Graph saturated      263
Graph Schrijver      240
Graph self-complementary      1464
Graph series-parallel      330 538
Graph shrinkable      197
Graph signed      2076 2077
Graph simple      5
Graph size of      5
Graph sparse      239
Graph split      266
Graph square lattice      684
Graph square of      52
Graph string      314
Graph strongly regular      684 750 1456 1462 1471 1498 1501 1513
Graph t-perfect      271
Graph t-tough      52
Graph theory      2167
Graph Thomsen      6
Graph tough      51 1472
Graph toughness of      52
Graph traceable      20
Graph transitively orientable      1476
Graph triangle-free      239 240 250
Graph triangular      684 750 751
Graph Turin      1234
Graph underlying      15
Graph uniform random      353
Graph unit-distance      834
Graph unlabeled      1060
Graph vertex-critical      268
Graph vertex-transitive      64 1452 1453 1464 1468—1473 1475 1477 1480—1482 1487 1488 1491 1493 1494 1500 1504
Graph very strong perfect      269
Graph weakly saturated      1273
Graph x-path      69
Graph-like state of matter      1975
Graphic matroid      491 494 505 516 518 532 547 594
Graphic notation      1959 2177
Graphical enumeration      1195
Graphical regular representation      see “GRR”
Grassmann variety      2041 2062 2064
Grassmann-Plucker relations      2063
Grassmannian      1510
Gratias, D.      945 958
Gray codes      1473
Greedoid      521 582 1546 1830 1857
Greedoid rank      1830
Greedy algorithm      139 373 638 1545—1547 2187
Greedy blocking set      1547 1548
Greedy heuristic      1546 1547
Greedy set      581
Greedy solution      1546
Green Hackenbush      2138
Green-Krotki, J.      213 214; J.”
Greenberg, A.G.      1146
Greene — Kleitman theorem      437 439
Greene, C.      137 438 439 516 667 1987
Greene, D.H.      1071 1127 1131 1140 1141 1171 1212
Greenwell, D.      253
Gregory, D.A.      1708; see de “Caen D.”
Gremwell, D.L.      1464 1521
Griesmer bound      782
Griffin, V      1685
Griffin, V.J.      1685; see “Araoz J.”
Griggs, J.R.      1187 1188 1989
Griggs, J.R.A.      1297; see “Furedi Z.”
Griggs, J.R.B.      1994 1995; M.S.”
Grigorchuk, R.I.      1479
Grigoryev, D.Yu.      1460 1511; L.”
Griinbaum, B.      59 260 276 303 310 311 811 815 816 818—825 831 841 852 855 856 858 879 885 891 893 895 897 907 910 923 1280 1490 1654 1765 1854 1859
Griinbaum, B.A.      884; see “Barnette D.”
Griinbaum, B.B.      153; see “Barnette D.W.”
Griinbaum, B.C.      821 823; S.”
Griinbaum, B.D.      826 839 841 848; L.”
Griinbaum, G.      882 907
Grimmett, G.      219
Grimmitt, G.R.      354 373 1936 1938
Grinberg graph      57
Grinberg, E.Ja.      56 79
Grinberg, V.S.      1420 1421 1423; I.”
Grinberg’s condition      56
Grincuk, M.I.      1351
Grinstead, C.      1389
Grinstead, C.M.      1346; see “Chung F.R.K.”
Grishukhin, V.P.      2049; see Deza M.
Gritzmann, P.      853 923 951
Gromov, M.      1477 1478
Gronau, H.D.O.F.      704
Gronau, H.D.O.F.A.      1296; see “Engel K.”
Gross, J.L.      305 321 325 1489 1493
Gross, J.L.A.      323; see “Fursl M.L.”
Grossman, J.W.      91
Grotschel, M.      40 54 206 236 265 267 269 271 569 1545 1570—1573 1592 1654 1662 1663 1689 1694—1696 1736 1881 1892—1894 1920 1950 1951 2016 2042
Grotschel, M.A.      1545; see “Bachem A.”
Grotschel, M.A.A.      1568 1572 1573 1696 1950 1951; F.”
Grotschel, M.B.      1573; see “Padberg M.W.”
Grotzsch theorem      260
Grotzsch, H.      260 296
Ground state      1946 1949
Ground states of spin glasses      1568
Group 2*-closed      1502
Group 2-closed      1502
Group 2-transitive      623 624
Group action of      614
Group afflne      1453 1454
Group almost simple      618
Group alternating      619 1473 1501
Group automorphism      784 938 1447 2054
Group base of a permutation      637 2057
Group basic      618
Group Bieberbach      942 943
Group black box      1519
Group CFSG      see “Classification of finite simple”
Group Chevalley      619
Group classical      620
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2019
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте