-
2
-
-
0011961520
-
Rectangular configurations which can be covered by 2 x 1 rectangles
-
Hetyei, G.: Rectangular configurations which can be covered by 2 x 1 rectangles (Hungarian). Pécsi Tan. Föisk Közl., 8, 351-367 (1964)
-
(1964)
Pécsi Tan. Föisk Közl.
, vol.8
, pp. 351-367
-
-
Hetyei, G.1
-
3
-
-
0000113399
-
The statistics of dimer on a lattice I., the number of dimer arrangements on a quadratic lattice
-
Kasteleyn, P.W.: The statistics of dimer on a lattice I., The number of dimer arrangements on a quadratic lattice. Physica 27, 1209-1225 (1961)
-
(1961)
Physica
, vol.27
, pp. 1209-1225
-
-
Kasteleyn, P.W.1
-
4
-
-
38249011999
-
Matching theory - A sampler: From Dénes König to the present
-
Plummer, M.D.: Matching theory - a sampler: From Dénes König to the present. Discrete Math. 100, 177-219 (1992)
-
(1992)
Discrete Math.
, vol.100
, pp. 177-219
-
-
Plummer, M.D.1
-
5
-
-
0041290790
-
Counting perfect matchings in polyominoes with applications to the dimer problem
-
John, P., Sachs, H., Zerntiz, H.: Counting perfect matchings in polyominoes with applications to the dimer problem. Zastosowania Matematyki (Appl. Math.) 19, 465-477 (1987)
-
(1987)
Zastosowania Matematyki (Appl. Math.)
, vol.19
, pp. 465-477
-
-
John, P.1
Sachs, H.2
Zerntiz, H.3
-
6
-
-
0042292555
-
Counting perfect matchings in lattice graphs
-
Heidelberg: Physica-Verlag
-
Sachs, H.: Counting perfect matchings in lattice graphs. In: Topics in combinatorics and graph theory, pp. 577-584. Heidelberg: Physica-Verlag 1990
-
(1990)
Topics in Combinatorics and Graph Theory
, pp. 577-584
-
-
Sachs, H.1
-
7
-
-
51249185806
-
Combinatorial properties of polyominoes
-
Berge, C., Chen, C.C., Chvátal, V., Soaw, C.S.: Combinatorial properties of polyominoes. Combinatorica 1, 217-224 (1981)
-
(1981)
Combinatorica
, vol.1
, pp. 217-224
-
-
Berge, C.1
Chen, C.C.2
Chvátal, V.3
Soaw, C.S.4
-
8
-
-
0012956930
-
The connectivity of Z-transformation graphs of perfect matchings of polyominoes
-
Zhang, Heping: The connectivity of Z-transformation graphs of perfect matchings of polyominoes. Discrete Math. 158, 257-272 (1996)
-
(1996)
Discrete Math.
, vol.158
, pp. 257-272
-
-
Zhang, H.1
-
9
-
-
51649151007
-
Perfect matchings in hexagonal systems
-
Zhang, Fuji, Guo, Xiaofeng, Chen, Rongsi: Perfect matchings in hexagonal systems, Graphs and Comb. 1, 383-386 (1985)
-
(1985)
Graphs and Comb.
, vol.1
, pp. 383-386
-
-
Zhang, F.1
Guo, X.2
Chen, R.3
-
10
-
-
27644475049
-
-
Wiss, Koll TH Ilmenau Vortragsreihe, E.
-
Kostochka, A.V.: Proc. 30th Internat, Wiss, Koll TH Ilmenau pp. 49-52. Vortragsreihe, E. 1985
-
(1985)
Proc. 30th Internat
, pp. 49-52
-
-
Kostochka, A.V.1
-
11
-
-
0344839288
-
A theorem concerning perfect matchings in hexagonal systems
-
Zhang, Fuji, Chen, Rongsi: A theorem concerning perfect matchings in hexagonal systems. Acta Math. Appl. Sinica 5(1), 1-5 (1989)
-
(1989)
Acta Math. Appl. Sinica
, vol.5
, Issue.1
, pp. 1-5
-
-
Zhang, F.1
Chen, R.2
-
12
-
-
27644532448
-
1-factors of triangle graphs
-
J. Akiyama: World Scientific
-
Akiyama, J., Kano, M.: 1-factors of triangle graphs. In: J. Akiyama: Number theory and combinatorics. pp. 21-35. World Scientific 1985
-
(1985)
Number Theory and Combinatorics
, pp. 21-35
-
-
Akiyama, J.1
Kano, M.2
-
14
-
-
0000238526
-
When each hexagon of a hexagonal system covers it
-
Zhang, Fuji, Chen, Rongsi: When each hexagon of a hexagonal system covers it. Discrete Appl. Math. 30, 63-75 (1991)
-
(1991)
Discrete Appl. Math.
, vol.30
, pp. 63-75
-
-
Zhang, F.1
Chen, R.2
-
16
-
-
0012233757
-
A linear algorithm for a perfect matching in hexagonal systems
-
Hansen, P., Zheng, Maolin: A linear algorithm for a perfect matching in hexagonal systems. Discrete Math. 122, 297-304 (1993)
-
(1993)
Discrete Math.
, vol.122
, pp. 297-304
-
-
Hansen, P.1
Zheng, M.2
|