| Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2017: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2016: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2015: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
|---|
| Outline of Final Research Achievements |
For a given graph, determining the page number seems to be a very important problem in both theoretical and practical reasons. In this research, our goal is to describe a relation between genus and page number of graphs, and we have succeeded in giving an upper bound for the page number of a graph embeddable on a surface, finding a suitable cycle of a graph with a good property. In particular, we have been able to give an upper bound for the page number of locally planar graphs on any orientable surfaces, and that for projective-planar graphs with respect to their connectivity.
|
