media archive
Computational sciences Conferences KIAS Workshop on Combinatorics
Loading the player ...
Classi?cation of regular embeddings of some graph families
SPEAKER  |  Youngsoo Kwon
INSTITUTE  |  Yeungnam University
DATE  |  May 31(Fri), 2013
TIME  |  14:10
PLACE  |  Conference room 1503, KIAS
Keyword  |  
Download  |  
ABSTRACT  |  A regular embedding is a highly symmetric graph embedding onto a surface. Classi?cations of regular embeddings are pursued by three different directions: by given graphs, groups and surfaces. In this talk, we will consider classi?cation of regular embeddings of graphs. I will introduce several methods to classify regular embeddings of graphs and some recent results.
  • On Combinatorial pro...
    Younjin Kim
    June 1(Sat), 2013
  • Flag enumeration of ...
    Sangwook Kim
    June 1(Sat), 2013
  • Classi?cation of reg...
    Youngsoo Kwon
    May 31(Fri), 2013
  • Zeta functions of ad...
    Mitsugu Hirasaka
    May 31(Fri), 2013
  • Fractional weak disc...
    Jeong Ok Choi
    May 31(Fri), 2013
  • Balanced labellings ...
    Hwanchul Yoo
    May 31(Fri), 2013
  • Colored permutations...
    Seunghyun Seo
    May 31(Fri), 2013
  • The Riordan group an...
    Gi-Sang Cheon
    May 30(Thu), 2013
  • Polytope numbers and...
    Hyun Kwang Kim
    May 30(Thu), 2013
  • Coloring of the squa...
    Seog-Jin Kim
    May 30(Thu), 2013