|
|
 |
| Авторизация |
|
|
|
| Поиск по указателям |
|
|
|
|
|
|
|
 |
|
|
|
| Tutte W.T. — Graph Theory as I Have Known It |
|
|
|
| Предметный указатель |
1-Factor Theorem 28—32
2-Connected graphs 7 111
2-Separable graphs 7
3-Connected graphs 7 83 91 111 144 145
4-Connected graphs 22
5-Flow Conjecture 51 52
Algebraic duality 58 85 87
Algorithm for graphic matroids 105
Alternating map 36—39 42 43 45
Alternating paths 28 30 32 33
Anacker, S. 111
Augusteijn, L. 43
Automorphism 64 75 78 80
Avoidance (bridges in a matroid) 103
Avoidance (bridges in graphs) 89 92
Balanced directed network 39
bands 121 125
Bari, Ruth 73 133
Barnette's Conjecture 44
Barycentric representation of planar graphs 144
Beraha numbers 136 138 139
Beraha polynomials 146
Beraha, S. 135
Berman, G. 56 133
Berman, K. 45
Bernhart, F. 73 136
Bicubic map 44 45 123
Biggs, N. 80 109 136 145
Binary chain-groups 95
Binary matroid 100 102
Birkhoff — Lewis equations 138 145
Birkhoff, G.D. 57 129
Block 92 96 104 111
BOND 86—88 91 92 95 104
Boundary 49
Boundary of a chain 47 49
Bouwkamp, C.J. 143 145
Bridges of a bond 92 104
Bridges of a circuit 88 92
Brooks' Theorem 1 57 82 83 85
Brooks, Mrs. 140 142
Brooks, R.L. 1 140 142
Brown, W.G. 124
c-Net of a squared rectangle 4 124
Cage 79
Canterbury Puzzles 1
Cayley, A. 114
cells 95—98 101
Cells of a matroid 99
Chain-group 95—104
Chains over a ring 46
Characteristic polynomial 109 112 113
Cheshire cat 94
Chess 12
Chromatic eigenvalues 127 139
Chromatic number 109 111
Chromatic polynomial 52 54 60 72 73 107—109 111 125 126 129 131 133
Chromatic sums 126 127 138 139
Circuits of a matroid 100
Coboundary 52
Combinatorial topology 46 47 50 94
Complexity at a vertex 40
Complexity of alternating network 40
Complexity of an electrical network 8 11 57 66
Component of a chain-group 96
Components of a graph 53
Compound perfect rectangle 7
Constrained chromial 129 130
Contraction of a chain-group 95
Contraction of a loop 91
Contraction of an edge 53 91
Contraction of the last edge 92
Coxeter, H.S.M. 12 79 80
Cremona — Richmond configuration 79
cross 4 43
Cubic graphs 13 18 46 51 52 58—60 63 74 82 94
Current 3 4 7 37 38 41 43 49 143
Dahab, R. 146
Degenerate bridges 23
Deletion of an edge 53 91
Dendroid 97—99 101 102
Dendroid of a chain-group 97
Dichromate 54 55 57 67 70 72 73
Dichromatic polynomial 53 54 110 111
Differential equations 128 139
Dirac, G.A. 22
Directed edge 36 37 48 49
Directed network 36
Directed tree 40
Dodecahedral graph 74
dodecahedron 133 136
Dual graphs 56 92
Dual matroid 100
Dual of a chain-group 96
Duijvestijn, A.J.W. 143
Edge-reconstruction 112
Electrical networks 3 4 6—9 11 36 38 39 42—44 66
Elementary chain 95—97 103
Elementary coboundary 86 87
Elementary cycle 47 85 96
Equations of generating functions 118 119 126 127
Euler Polyhedron Formula 36
Eulerian planar maps 123
f-factor theorem 31 32
Faces of a c-net 4
Factors of a graph 24 60
Fano matroid 101 102
Flats of a matroid 103
Flattening equations 136
Flipping a rotor 66 70
Flow-polynomial 53 54 60 111
Foldes, S. 72
Foster, R.M. 53 80
Four colour problem 13 81
Four colour theorem 24 25 58 85 128
Four-Colour averages 125
Free chromial 130—132
Frucht, R. 80
Full elements of a squared rectangle 8
Full flow in an electrical network 41
Full sides of a squared rectangle 8
Gallai, T. 30
Generating function 116 118—120 125
Golden identity 134—137
Golden number 126 134
Golden root 135—137
Graphic matroid 102
Grinberg's Theorem 18 19 21 87 88
Grinberg's Theorem, dual form 88
Grinberg, E. 18
Hadwiger's conjecture 85
Hajos' conjecture 85
Hall's theorem 30
Hall, D.W. 133—136
Hall, P. 30
Hamilton, Sir W.R. 12
Hamiltonian bond 87 88
Hamiltonian circuit 1 13—19 21 22 24 26 33 44 47 74 87 109 111 112 120
Hamiltonian cycle 47
Heawood graph 77 78
Heawood, P.J. 44 46
Honsberger, R. 144
Hyperprime graph 29
Impedances 73
Integral chain-group 95
Isomers 141
Isthmus 25 51 54 55 67 69 70 91 116
Jacobi's theorem 26 27 73 113
Jaeger, F. 51
Jordan's Theorem 88
| Kasteleyn, P.J. 27 63
Kelly's lemma 109—113
Kirchhoff matrix 7 26 27 99 112
Kirchhoff matrix generalized 39
Kirchhoff's laws 7 140
Kirchhoff's Laws generalized 37
Kirkman, T.P. 13 145
Knight's Tour 12 13
Kocay, W.L. 110
Kuratowski's theorem 76 89 103
Leaky electricity 34 37 40
Lee, L. 73
Lewis, D.C. 133
Lines of a matroid 103
Link-map 125 126
Loop 21 28 30 49 52 54 55 59 60 67 69 70 85 91 92 107 116 131
Loose edge 59 60
Lusin's Conjecture 2 11
m-Colouring 49 50 52
m-Flow 51 52
MAP 13 24 75 82
Matrix of chromatic joins 146
Matrix-tree theorem 11 40 43 44 99
Matrix-Tree Theorem for directed graph 40
Matroid 99—102 145
Matroid of a chain-group 102
Maunsell, F.G. 28
McGee, W.F. 79
Minor of a chain-group 102
Minor of a graph 85
Minors of a matroid 102
Moron, Z. 2
Mullin, R.C. 117 124
n-Clique 82
Near-triangulations 22 116 118 125—127 138
Non-Hamiltonian cubic planar maps 21
Non-Hamiltonian graphs 79
Non-Hamiltonian maps 18 19
Nowhere-zero coboundary 52
Nowhere-zero cycle 50—52
Order of a squared rectangle 3
Order of a triangulated parallelogram 35
Orthogonal chains 58
Outgrowths 92
Overlapping bridges in graphs 89 93
Overlapping bridges in matroids 103
Parametric equations 119 120 124 139
Partition of a bond 92
Partition of the vertex-set 129
Perfect rectangles 2—4 6 8 10 35 140 141
Perfect squares 10 11 26 64 67 142 143
Perfect triangulations 35
Peripheral circuits 89 91 104 105
Peripheral circuits in a matroid 104
Petersen graph 25 26 51 75—77 79 85
Petersen's theorem 1 25 26 29 30
Petersen, J. 24 25
Pfaffian 26 27 63
Planar graphs 10 27 58 63 81 82 87 145
Planar partition 136
Planar triangulations 22 114 133—135
Plane graphs 81 144
Points of a matroid 103
Polar edges 4
Polyhedra 7 13 81 82 124
Posa, L. 22
Prime graphs 27
Primitive chain-groups 97
prism 14 17 18
Radiants of a face 17
Rank of a chain-group 97
Reconstructible graph 106
Reconstructible graph-property 106
Reconstruction Conjecture 106 112 113
Reduced sides and elements 8
Reduction 8 26 41 42 140
Reduction of a chain-group 95 97
Reduction of a squared rectangle 8 26 142
Regular chain-group 97 99—101
Regular elements of a ring 97
Regular graphs 24
Regular matroid 102
Representative matrix of a chain-group 99
Residual arcs of a bridge 92
Residual graph of a circuit 22
Rooted 3-connected planar maps 124
Rooted non-separable planar maps 124
Rooted planar maps 124
Rooted triangulations 116 125 128
Rooted triangulations, with colouring 125
rotors 64 65 70 72 140 141
s-Regular graphs 76 79 80
Sachs, H. 23
Sainte-Laguee, M.A. 26
Sands, D. 136
Schellenberg, P.J. 124
Semiperimeter 8
Separable graphs 6 56
Separating digon 114
Separating triangle 22 114
Serpens 74—76 79
Seymour, P.D. 51
Shearing a squared rectangle 34
Silver root 135 137
Simple perfect rectangle 7
Simple perfect square 11 143
Sims, C. 80
Skinner, J.D. 143
Slicing of the band 121
Smith's theorem 1 18 47 48 57 94
Smith, C.A.B. 1 13 44
Snark 51 52 85
Spanning tree 11 40 43 44 98
Spectrum of a graph 112
Sprague, R.P. 10 142
Squared rectangle 3 4 7 8 14 34 36 38 39 44 113 143
Standard representative matrix of a chain-group 99 101
Stator 65—67 69 70 74
Steinitz' Theorem 7 13
Stirling's formula 120
Stone, A.H. 1
Support of a chain 85
Tait colouring 24 25 47—51 79 85 94
Tait cycle 24—26 47 48 51 94 121
Tait's conjecture 13—15 17—19
Tait, P.G. 13 24 82
Theoretical perfect squares 10
Theory of numbers 142
Topological invariance 60
Totally unimodular matrix 99 101
Transpedance 73
Tree-number 67 73 74
Trees 11 24 27 40 87 109 113 114
Triangulated parallelograms 34—38 40 42 43 45
Triangulated triangles 34 36 42—45
Trine alternating graphs 44
Trinity College, Cambridge 13
Trivial imperfection in a c-net 143
Truncated icosahedron 133—136
Tutte polynomial 54 57
Twisting an edge in a cubic graph 58
Ulam's Conjecture 106
Unsymmetrical electricity 40 48
V-Functions 60
Veblen, O. 46
Vertex-deleted subgraphs 106 107 109 112
Vertex-elimination Theorem 136
Vertex-graph 54 92 106 107
Vertices of a bridge 89
Vertices of attachment of a bridge 23 89
|
|
|
| Реклама |
|
|
|
|
|
О проекте