Counting triangulations of planar point sets.
Sharir, Micha, Sheffer, Adam (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
Displaying similar documents to “Combinatorial stacks and the four-color theorem”
Counting triangulations of planar point sets.
Product and puzzle formulae for Belkale-Kumar coefficients.
Knutson, Allen, Purbhoo, Kevin (2011)
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 rectilinear crossing number of is 62.
Brodsky, Alex, Durocher, Stephane, Gethner, Ellen (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the genus distribution of -dipoles.
Visentin, Terry I., Wieler, Susana W. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-configurations with simple edge basis and their corresponding quasigroup identities
Václav J. Havel (1993)
Archivum Mathematicum
Similarity:
There is described a procedure which determines the quasigroup identity corresponding to a given 3-coloured 3-configuration with a simple edge basis.
On the number of fully packed loop configurations with a fixed associated matching.
Caselli, F., Krattenthaler, C., Lass, B., Nadeau, P. (2004)
The Electronic Journal of Combinatorics [electronic only]
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: