The block plan problem. A graphtheoretic approach
Kybernetika (1973)
- Volume: 09, Issue: 5, page (365)-373
- ISSN: 0023-5954
Access Full Article
topHow to cite
topNieminen, U. J.. "The block plan problem. A graphtheoretic approach." Kybernetika 09.5 (1973): (365)-373. <http://eudml.org/doc/27894>.
@article{Nieminen1973,
author = {Nieminen, U. J.},
journal = {Kybernetika},
language = {eng},
number = {5},
pages = {(365)-373},
publisher = {Institute of Information Theory and Automation AS CR},
title = {The block plan problem. A graphtheoretic approach},
url = {http://eudml.org/doc/27894},
volume = {09},
year = {1973},
}
TY - JOUR
AU - Nieminen, U. J.
TI - The block plan problem. A graphtheoretic approach
JO - Kybernetika
PY - 1973
PB - Institute of Information Theory and Automation AS CR
VL - 09
IS - 5
SP - (365)
EP - 373
LA - eng
UR - http://eudml.org/doc/27894
ER -
References
top- C. Benzaken, Pseudo-treillis distributifs et applications III, Buletinul Institutului Politehnic din Iasi XIV (1968), 3-4, 25. (1968) Zbl0208.29502MR0256942
- 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. (1968)
- R. Busacker T. Saaty, Finite graphs and networks: An Introduction with applications, McGraw-Hill, New York 1965. (1965) MR0209176
- 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. (1968) MR0281544
- P. L. Hammer S. Rudeanu, Boolean methods in operations research and related areas, Springer-Verlag, Berlin - Heidelberg 1968. (1968) MR0235830
- S. MacLane, A combinatorial condition for planar graphs, Fundamenta Mathematica 28 (1937), 22. (1937) Zbl0015.37501
- J. J. Seppänen J. M. Moore, Facilities planning with graph theory, Management Science (Application) 17 (1970), B-242. (1970)
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.