Counting triangulations of planar point sets.
Sharir, Micha, Sheffer, Adam (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On the genus distribution of -dipoles.”
Counting triangulations of planar point sets.
On a problem of R. Häggkvist concerning edge-colourings of graphs
Bohdan Zelinka (1978)
Časopis pro pěstování matematiky
Similarity:
On hyperbolic 3-manifolds realizing the maximal distance between toroidal Dehn fillings.
Goda, Hiroshi, Teragaito, Masakazu (2005)
Algebraic & Geometric Topology
Similarity:
On the dimer problem and the Ising problem in finite 3-dimensional lattices.
Loebl, Martin (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Partitions and edge colourings of multigraphs.
Kostochka, Alexandr V., Stiebitz, Michael (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the number of planar orientations with prescribed degrees.
Felsner, Stefan, Zickfeld, Florian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The excessive [3]-index of all graphs.
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Regulated buildups of 3-configurations
Václav J. Havel (1994)
Archivum Mathematicum
Similarity:
We deal with two types of buildups of 3-configurations: a generating buildup over a given edge set and a regulated one (according to maximal relative degrees of vertices over a penetrable set of vertices). Then we take account to minimal generating edge sets, i.e., to edge bases. We also deduce the fundamental relation between the numbers of all vertices, of all edges from edge basis and of all terminal elements. The topic is parallel to a certain part of Belousov' “Configurations...