相关论文: Face pairing graphs and 3-manifold enumeration

We enumerate rooted 2-connected and 3-connected surface maps with respect to vertices and edges. We also derive the bivariate version of the large face-width result for random 3-connected maps. These results are then used to derive…

The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected plane graph is a 3-connected plane graph. Astonishingly, except for sufficiently large facewidth, not much is known about the connectivity…

A dominating set of a graph $G$ is a subset $D$ of vertices such that every vertex not in $D$ is adjacent to at least one vertex in $D$. A dominating set $D$ is paired if the subgraph induced by its vertices has a perfect matching, and…

In this paper we enumerate and classify the ``simplest'' pairs (M,G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the pairs we use a variation of Matveev's definition of complexity for…

We develop a technique for gluing relative trisection diagrams of $4$-manifolds with nonempty connected boundary to obtain trisection diagrams for closed $4$-manifolds. As an application, we describe a trisection of any closed $4$-manifold…

We characterise graphs that have three distinct eigenvalues and coherent ranks 8 and 9, linking the former to certain symmetric 2-designs and the latter to specific quasi-symmetric 2-designs. This characterisation leads to the discovery of…

We obtain the formulae for the numbers of 4-matchings and 5-matchings in terms of the number of hexagonal faces in (4, 6)-fullerene graphs by studying structural classification of 6-cycles and some local structural properties, which correct…

We show that if two 3-manifolds with toroidal boundary are glued via a `sufficiently complicated' map then every Heegaard splitting of the resulting 3-manifold is weakly reducible. Additionally, if Z is a manifold obtained by gluing X and…

This paper deals with triangulations of the 2-torus with the vertex labeled general octahedral graph $O_4$ which is isomorphic to the complete four-partite graph $K_{2,2,2,2}$; it is known that there exist precisely twelve such…

A plane graph is l-facially k-colourable if its vertices can be coloured with k colours such that any two distinct vertices on a facial segment of length at most l are coloured differently. We prove that every plane graph is 3-facially…

We show that 4-connected plane triangulations can be redrawn such that edges are represented by straight segments and the vertices are covered by a set of at most $\sqrt{2n}$ lines each of them horizontal or vertical. The same holds for all…

Let $T$ be a graph in a compact, orientable 3--manifold $M$ and let $\Gamma$ be a subgraph. $T$ can be placed in bridge position with respect to a Heegaard surface $H$. We show that if $H$ is what we call $(T,\Gamma)$-c-weakly reducible in…

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph on two vertices. A graph $G$ is prism-hamiltonian if the prism over $G$ is hamiltonian. We prove that every polyhedral graph (i.e. 3-connected planar graph)…

A Heegaard diagram for a 3-manifold is regarded as a pair of simplexes in the complex of curves on a surface and a Heegaard splitting as a pair of subcomplexes generated by the equivalent diagrams. We relate geometric and combinatorial…

A connected graph is 4-connected if it contains at least five vertices and removing any three of them does not disconnect it. A frequent preprocessing step in graph drawing is to decompose a plane graph into its 4-connected components and…

Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…

Face clustering plays an essential role in exploiting massive unlabeled face data. Recently, graph-based face clustering methods are getting popular for their satisfying performances. However, they usually suffer from excessive memory…

A $3$-polytope is a $3$-connected, planar graph. It is called unigraphic if it does not share its vertex degree sequence with any other $3$-polytope, up to graph isomorphism. The classification of unigraphic $3$-polytopes appears to be a…

Deciding whether a collection of unrooted trees is compatible is a fundamental problem in phylogenetics. Two different graph-theoretic characterizations of tree compatibility have recently been proposed. In one of these, tree compatibility…

We give a linear-time algorithm to decide 3-colorability (and find a 3-coloring, if it exists) of quadrangulations of a fixed surface. The algorithm also allows to prescribe the coloring for a bounded number of vertices.