Affiliation:
1. Department of Computer Science Columbia University New York New York USA
Funder
Division of Computing and Communication Foundations
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference24 articles.
1. D.Archdeacon.Nearly triangular imbeddings of complete graphs;1995.http://www.cems.uvm.edu/TopologicalGraphTheoryProblems/neartri.htm
2. Exponential Families of Non-Isomorphic Triangulations of Complete Graphs
3. A six color problem;Franklin P.;Stud. Appl. Math.,1934
4. Embeddings of small graphs on the torus;Gagarin A.;Cubo Mat. Educ.,2003
5. Triangular embeddings of complete graphs from graceful labellings of paths
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献