-
2
-
-
0000192876
-
Dissection of rectangles into squares
-
R. L. Brooks, C. A. B. Smith, A. H. Stone and W. T. Tutte, Dissection of rectangles into squares, Duke Math. J., 7 (1940), 312-340.
-
(1940)
Duke Math. J.
, vol.7
, pp. 312-340
-
-
Brooks, R.L.1
Smith, C.A.B.2
Stone, A.H.3
Tutte, W.T.4
-
3
-
-
0010944217
-
Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimization design theory
-
C. Cheng, Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimization design theory, J. Combin. Theory, Ser. B, 31 (1981), 240-248.
-
(1981)
J. Combin. Theory, Ser. B
, vol.31
, pp. 240-248
-
-
Cheng, C.1
-
4
-
-
0004092833
-
-
Academic Press, New York, San Francisco, London
-
D. M. Cvetkovic, M. Doob and H. Sachs, Spectra of Graphs, Academic Press, New York, San Francisco, London, 1980.
-
(1980)
Spectra of Graphs
-
-
Cvetkovic, D.M.1
Doob, M.2
Sachs, H.3
-
7
-
-
0040820990
-
On properties of the characteristic polynomial of a graph
-
Gosenergoizdat, Moscow
-
A. K. Kelmans, On properties of the characteristic polynomial of a graph, in: Kibernetiku - Na Sluzbu Kommunizmu, 4, Gosenergoizdat, Moscow, 1967, pp. 27-41.
-
(1967)
Kibernetiku - Na Sluzbu Kommunizmu
, vol.4
, pp. 27-41
-
-
Kelmans, A.K.1
-
8
-
-
0041150047
-
Comparison of graphs by their number of spanning trees
-
A. K. Kelmans, Comparison of graphs by their number of spanning trees, Discr. Math., 16 (1976), 241-261.
-
(1976)
Discr. Math.
, vol.16
, pp. 241-261
-
-
Kelmans, A.K.1
-
9
-
-
30244483318
-
Operations on graphs that increase the number of their spanning trees
-
Nauka, Moscow
-
A. K. Kelmans, Operations on graphs that increase the number of their spanning trees, in: Issledovanie po Discretnoy Optimizacii, Nauka, Moscow, 1976, pp. 406-424.
-
(1976)
Issledovanie po Discretnoy Optimizacii
, pp. 406-424
-
-
Kelmans, A.K.1
-
10
-
-
0009070554
-
The number of graph spanning trees containing a given forest
-
A. K. Kelmans, The number of graph spanning trees containing a given forest, Acta Math. Acad. Sci. Hungar., 27(1-2) (1976), 89-95.
-
(1976)
Acta Math. Acad. Sci. Hungar.
, vol.27
, Issue.1-2
, pp. 89-95
-
-
Kelmans, A.K.1
-
11
-
-
0039962900
-
Graphs with extremal number of spanning trees
-
A. K. Kelmans, Graphs with extremal number of spanning trees, J. Graph Theory, 4 (1980), 119-122.
-
(1980)
J. Graph Theory
, vol.4
, pp. 119-122
-
-
Kelmans, A.K.1
-
13
-
-
30244513277
-
Operations on graphs increasing their Laplacian polynomials
-
Rutgers University
-
A. K. Kelmans, Operations on graphs increasing their Laplacian polynomials, RUTCOR research Report 18-95, Rutgers University, 1995, pp. 1-17.
-
(1995)
RUTCOR Research Report 18-95
, pp. 1-17
-
-
Kelmans, A.K.1
-
14
-
-
0040555950
-
A certain polynomial of a graph and graphs with an extremal numbers of trees
-
A. K. Kelmans and V. M. Chelnokov, A certain polynomial of a graph and graphs with an extremal numbers of trees. J. Combin. Theory, Ser. B, 16 (1974), 197-214.
-
(1974)
J. Combin. Theory, Ser. B
, vol.16
, pp. 197-214
-
-
Kelmans, A.K.1
Chelnokov, V.M.2
-
15
-
-
4944257625
-
Über die Auflösung der gleichungen, auf welche man bei der untersuchung der linearen Vertheilung galvanischer ströme geführt wird
-
G. Kirchhoff, Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird, Ann. Phys. Chem., 72 (1847), 497-508.
-
(1847)
Ann. Phys. Chem.
, vol.72
, pp. 497-508
-
-
Kirchhoff, G.1
|