Three-dimensional pseudomanifolds on eight vertices.
Datta, Basudeb, Nilakantan, Nandini (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “Positively curved combinatorial 3-manifolds.”
Three-dimensional pseudomanifolds on eight vertices.
A census of vertices by generations in regular tessellations of the plane.
Paul, Alice, Pippenger, Nicholas (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Geodetic graphs of diameter two
Bohdan Zelinka (1975)
Czechoslovak Mathematical Journal
Similarity:
Edge Dominating Sets and Vertex Covers
Ronald Dutton, William F. Klostermeyer (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering, edge domination, and matching parameters is explored. In addition, the total vertex cover number is compared to the total domination number of trees and grid graphs.
The isogonal sponges on the cubic lattice.
Gillispie, Steven B., Grünbaum, Branko (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A theorem on nonexistence of a certain type of nearly regular cell-decompositions of the sphere
Mirko Horňák (1978)
Časopis pro pěstování matematiky
Similarity:
Planar maps as labeled mobiles.
Bouttier, J., Di Francesco, P., Guitter, E. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Even kernels.
Fraenkel, Aviezri (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Vertex Separation of Maximal Outerplanar Graphs
Markov, Minko (2008)
Serdica Journal of Computing
Similarity:
We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability, of submops.