Steiner's problem in graphs and its implications

This publication has 20 references indexed in Scilit:

• Simplification of the Covering Problem with Application to Boolean Expressions
  Journal of the ACM, 1970
• Maximum internally stable sets of a graph
  Journal of Mathematical Analysis and Applications, 1969
• Steiner Minimal Trees
  SIAM Journal on Applied Mathematics, 1968
• On cliques in graphs
  Israel Journal of Mathematics, 1965
• Covers and packings in a family of sets
  Bulletin of the American Mathematical Society, 1962
• On the Problem of Steiner
  Canadian Mathematical Bulletin, 1961
• The zero error capacity of a noisy channel
  IEEE Transactions on Information Theory, 1956
• On the shortest spanning subtree of a graph and the traveling salesman problem
  Proceedings of the American Mathematical Society, 1956
• Connectivity and Generalized Cliques in Sociometric Group Structure
  Psychometrika, 1950
• Über Axiomensysteme für beliebige Satzsysteme
  Mathematische Annalen, 1922