Related papers: $h$-perfect plane triangulations
It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive…
This paper considers "geometric" ideal triangulations of cusped hyperbolic 3-manifolds, i.e. decompositions into positive volume ideal hyperbolic tetrahedra. We exhibit infinitely many geometric ideal triangulations of the figure eight knot…
Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…
A triangulation of a simplicial complex $\Delta$ is called uniform if the $f$-vector of its restriction to a face of $\Delta$ depends only on the dimension of that face. This paper proves that the entries of the $h$-vector of a uniform…
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…
Deciding whether a planar graph (even of maximum degree $4$) is $3$-colorable is NP-complete. Determining subclasses of planar graphs being $3$-colorable has a long history, but since Gr\"{o}tzsch's result that triangle-free planar graphs…
Barnette's Conjecture claims that all cubic, 3-connected, planar, bipartite graphs are Hamiltonian. We give a translation of this conjecture into the matching-theoretic setting. This allows us to relax the requirement of planarity to give…
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum degree six or seven.
A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.
Let $\Bbbk$ be a perfect field with algebraic closure $\overline{\Bbbk}$. If $H$ is a subgroup of plane automorphisms over $\Bbbk$ and $p\in\overline{\Bbbk}^2$ is a point, we describe the subgroup consisting of plane automorphisms which…
A conjecture of Barnette states that every 3-connected cubic bipartite plane graph has a Hamilton cycle, which is equivalent to the statement that every simple even plane triangulation admits a partition of its vertex set into two subsets…
We call a triangulated category \emph{hereditary} provided that it is equivalent to the bounded derived category of a hereditary abelian category, where the equivalence is required to commute with the translation functors. If the…
A graph is {\em perfect} if, in all its induced subgraphs, the size of a largest clique is equal to the chromatic number. Examples of perfect graphs include bipartite graphs, line graphs of bipartite graphs and the complements of such…
We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…
For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a…
We introduce a concept, $d$-complete, and show that a Lie algebra is $d$-complete if and only if its full graph is complete.
For any H in [0,1), we construct complete, non-proper, stable, simply-connected surfaces with constant mean curvature H embedded in hyperbolic 3-space.
We prove discrete Helly-type theorems for pseudohalfplanes, which extend recent results of Jensen, Joshi and Ray about halfplanes. Among others we show that given a family of pseudohalfplanes $\cal H$ and a set of points $P$, if every…
A multigraph is exactly k-edge-connected if there are exactly k edge-disjoint paths between any pair of vertices. We characterize the class of exactly 3-edge-connected graphs, giving a synthesis involving two operations by which every…