Minimal binary trees with regular boundary: the~case of sceletons with four ends
    
    
  
  
  
      
      
      
        
Sbornik. Mathematics, Tome 187 (1996) no. 4, pp. 581-622
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			This work continues an investigation of locally minimal binary trees spanning the vertices of regular polygons. The technique developed has led to essential progress in the solution of this problem.
			
            
            
            
          
        
      @article{SM_1996_187_4_a3,
     author = {A. A. Tuzhilin},
     title = {Minimal binary trees with regular boundary: the~case of sceletons with four ends},
     journal = {Sbornik. Mathematics},
     pages = {581--622},
     publisher = {mathdoc},
     volume = {187},
     number = {4},
     year = {1996},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SM_1996_187_4_a3/}
}
                      
                      
                    A. A. Tuzhilin. Minimal binary trees with regular boundary: the~case of sceletons with four ends. Sbornik. Mathematics, Tome 187 (1996) no. 4, pp. 581-622. http://geodesic.mathdoc.fr/item/SM_1996_187_4_a3/
