相关论文: Zigzag Structure of Simple Two-faced Polyhedra
It is shown that every $n$-vertex graph that admits a 2-bend RAC drawing in the plane, where the edges are polylines with two bends per edge and any pair of edges can only cross at a right angle, has at most $20n-24$ edges for $n\geq 3$.…
Kokotsakis studied the following problem in 1932: Given is a rigid closed polygonal line (planar or non-planar), which is surrounded by a polyhedral strip, where at each polygon vertex three faces meet. Determine the geometries of these…
A minimally rigid graph, also called Laman graph, models a planar framework which is rigid for a general choice of distances between its vertices. In other words, there are finitely many ways, up to isometries, to realize such a graph in…
In 2020, Cameron et al. introduced the restricted numerical range of a digraph (directed graph) as a tool for characterizing digraphs and studying their algebraic connectivity. In particular, digraphs with a restricted numerical range of a…
A calligraph is a graph that for almost all edge length assignments moves with one degree of freedom in the plane, if we fix an edge and consider the vertices as revolute joints. The trajectory of a distinguished vertex of the calligraph is…
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…
In this paper we define and study a ring associated to a graph that we call the cographic toric face ring, or simply the cographic ring. The cographic ring is the toric face ring defined by the following equivalent combinatorial structures…
A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…
A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…
Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Ba\v{s}i\'c, Fowler and Pisanski proved that the automorphism group of a nut graph has…
For an angle $\alpha\in (0,\pi)$, we consider plane graphs and multigraphs in which the edges are either (i) one-bend polylines with an angle $\alpha$ between the two edge segments, or (ii) circular arcs of central angle $2(\pi-\alpha)$. We…
A {\em string graph} is the intersection graph of a family of continuous arcs in the plane. The intersection graph of a family of plane convex sets is a string graph, but not all string graphs can be obtained in this way. We prove the…
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called balanced, such that no theta subgraph contains exactly two balanced circles. A biased graph $\Omega$ has two natural matroids, the frame matroid…
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…
Stan Wagon asked the following in 2000. Is every zonohedron face 3-colorable when viewed as a planar map? An equivalent question, under a different guise, is the following: is the arrangement graph of great circles on the sphere always…
By a poly-line drawing of a graph G on n vertices we understand a drawing of G in the plane such that each edge is represented by a polygonal arc joining its two respective vertices. We call a turning point of a polygonal arc the bend. We…
A mixed regular graph is a graph where every vertex has $z$ incoming arcs, $z$ outgoing arcs, and $r$ edges; furthermore, if it has girth $g$, we say that the graph is a \emph{$[z,r;g]$-mixed graph}. A \emph{$[z,r;g]$-mixed cage} is a…
A graph drawn in the plane with straight-line edges is called a geometric graph. If no path of length at most $k$ in a geometric graph $G$ is self-intersecting we call $G$ $k$-locally plane. The main result of this paper is a construction…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous deformations of the vertices arise from…