• On the Steiner, geodetic and hull numbers of graphs 

      Hernando Martín, María del Carmen; Tao, Jiang; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Seara Ojea, Carlos (2003)
      Article
      Accés obert
      Given a graph G and a subset W ? V (G), a Steiner W-tree is a tree of minimum order that contains all of W. Let S(W) denote the set of all vertices in G that lie on some Steiner W-tree; we call S(W) the Steiner interval ...