Previous |  Up |  Next


Title: The block plan problem. A graphtheoretic approach (English)
Author: Nieminen, U. J.
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 9
Issue: 5
Year: 1973
Pages: (365)-373
Category: math
MSC: 05C10
MSC: 90B99
MSC: 90C10
MSC: 90C35
idZBL: Zbl 0264.90030
idMR: MR0351431
Date available: 2009-09-24T16:35:04Z
Last updated: 2012-06-04
Stable URL:
Reference: [1] C. Benzaken: Pseudo-treillis distributifs et applications III.Buletinul Institutului Politehnic din Iasi XIV (1968), 3-4, 25. Zbl 0208.29502, MR 0256942
Reference: [2] C. Benzaken: Structures algebriques des cheminements: Pseudo-treillis, gerbiers carré nul.In: "Network and switching theory. A NATO advanced study institute" ed. by G Biorci, 1968, p. 40.
Reference: [3] R. Busacker T. Saaty: Finite graphs and networks: An Introduction with applications.McGraw-Hill, New York 1965. MR 0209176
Reference: [4] W. R. Dunn, Jr. S. P. Chan: An algorithm for testing the planarity of a graph.IEEE Transactions on Circuit Theory CT-15 (1968), 166. MR 0281544
Reference: [5] P. L. Hammer S. Rudeanu: Boolean methods in operations research and related areas.Springer-Verlag, Berlin - Heidelberg 1968. MR 0235830
Reference: [6] S. MacLane: A combinatorial condition for planar graphs.Fundamenta Mathematica 28 (1937), 22. Zbl 0015.37501
Reference: [7] J. J. Seppänen J. M. Moore: Facilities planning with graph theory.Management Science (Application) 17 (1970), B-242.


Files Size Format View
Kybernetika_09-1973-5_4.pdf 615.5Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo