A triangulated K3 surface with the minimum number of vertices

Author： Casella M.   Kuhnel W.  

Publisher： Elsevier

ISSN： 0040-9383

Source： Topology, Vol.40, Iss.4, 2001-07, pp. : 753-772

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An edge-swap heuristic for generating spanning trees with minimum number of branch vertices

By Silva Ricardo   Silva Diego   Resende Mauricio   Mateus Geraldo   Gonçalves José   Festa Paola  

Optimization Letters, Vol. 8, Iss. 4, 2014-04 ,pp. : 1225-1243

Springer Publishing Company

Access to resources Recommend Favorite

Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4

By Borodin O.   Ivanova A.  

Siberian Mathematical Journal, Vol. 55, Iss. 1, 2014-01 ,pp. : 12-18

Springer Publishing Company

Access to resources Recommend Favorite

Many triangulated 3-spheres

By Pfeifle Julian  

Mathematische Annalen, Vol. 330, Iss. 4, 2004-12 ,pp. : 829-837

Springer Publishing Company

Access to resources Recommend Favorite

Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree

By Henning Michael   Plummer Michael  

Journal of Combinatorial Optimization, Vol. 10, Iss. 3, 2005-11 ,pp. : 283-294

Springer Publishing Company

Access to resources Recommend Favorite

Vertices contained in all minimum paired-dominating sets of a tree

By Chen Xue-gang  

Czechoslovak Mathematical Journal, Vol. 57, Iss. 1, 2007-03 ,pp. : 407-417

Springer Publishing Company

Access to resources Recommend Favorite