Doubly Even Orientable Closed 2-cell Embeddings of the Complete Graph
暂无分享,去创建一个
[1] Jonathan L. Gross,et al. Topological Graph Theory , 1987, Handbook of Graph Theory.
[2] Mike J. Grannell,et al. Exponential Families of Non-Isomorphic Triangulations of Complete Graphs , 2000, J. Comb. Theory, Ser. B.
[3] Helen Verrall,et al. Cycle decompositions IV: complete directed graphs and fixed length directed cycles , 2003, J. Comb. Theory, Ser. A.
[4] G. Ringel. Map Color Theorem , 1974 .
[5] Mike J. Grannell,et al. A lower bound for the number of orientable triangular embeddings of some complete graphs , 2010, J. Comb. Theory, Ser. B.
[6] Vladimir P. Korzhik,et al. On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs , 2001, J. Comb. Theory, Ser. B.
[7] Mark N. Ellingham,et al. The nonorientable genus of joins of complete graphs with large edgeless graphs , 2007, J. Comb. Theory, Ser. B.
[8] Vladimir P. Korzhik. Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph , 2013, J. Graph Theory.
[9] J. Gross,et al. The topological theory of current graphs , 1974 .
[10] Mark N. Ellingham,et al. The orientable genus of some joins of complete graphs with large edgeless graphs , 2009, Discret. Math..
[11] Mike J. Grannell,et al. Hamiltonian embeddings from triangulations , 2007 .