Premium
Recursive constructions for triangulations
Author(s) -
Grannell M. J.,
Griggs T. S.,
Širáň J.
Publication year - 2002
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10014
Subject(s) - combinatorics , mathematics , graph , discrete mathematics
Three recursive constructions are presented; two deal with embeddings of complete graphs and one with embeddings of complete tripartite graphs. All three facilitate the construction of 2 an 2 − o ( n 2) non‐isomorphic face 2‐colourable triangulations of K n and K n,n,n in orientable and non‐orientable surfaces for values of n lying in certain residue classes and for appropriate constants a . © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 87–107, 2002