• Title of article

    Face Size and the Maximum Genus of a Graph 1. Simple Graphs

  • Author/Authors

    Huang، نويسنده , , Yuanqiu and Liu، نويسنده , , Yanpei، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2000
  • Pages
    15
  • From page
    356
  • To page
    370
  • Abstract
    This paper shows that a simple graph which can be cellularly embedded on some closed surface in such a way that the size of each face does not exceed 7 is upper embeddable. This settles one of two conjectures posed by Nedela and Škoviera (1990, in “Topics in Combinatorics and Graph Theory,” pp. 519–529, Physica Verlag, Heidelberg). The other conjecture will be proved in a sequel to this paper.
  • Journal title
    Journal of Combinatorial Theory Series B
  • Serial Year
    2000
  • Journal title
    Journal of Combinatorial Theory Series B
  • Record number

    1526738