zbMATH — the first resource for mathematics

The block plan problem. A graphtheoretic approach. (English) Zbl 0264.90030
90C35 Programming involving graphs or networks
05C10 Planar graphs; geometric and topological aspects of graph theory
90C10 Integer programming
Full Text: EuDML
[1] C. Benzaken: Pseudo-treillis distributifs et applications III. Buletinul Institutului Politehnic din Iasi XIV (1968), 3-4, 25. · Zbl 0208.29502
[2] C. Benzaken: Structures algebriques des cheminements: Pseudo-treillis, gerbiers carré nul. ”Network and switching theory. A NATO advanced study institute” by G Biorci, 1968, p. 40. · Zbl 0285.06005
[3] R. Busacker T. Saaty: Finite graphs and networks: An Introduction with applications. McGraw-Hill, New York 1965. · Zbl 0146.20104
[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.
[5] P. L. Hammer S. Rudeanu: Boolean methods in operations research and related areas. Springer-Verlag, Berlin - Heidelberg 1968. · Zbl 0155.28001
[6] S. MacLane: A combinatorial condition for planar graphs. Fundamenta Mathematica 28 (1937), 22. · Zbl 0015.37501
[7] J. J. Seppänen J. M. Moore: Facilities planning with graph theory. Management Science (Application) 17 (1970), B-242. · Zbl 0214.18903
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.