Related papers: Splittings of Tangles and Spatial Graphs
We review mathematically tractable models for connected networks on random points in the plane, emphasizing the class of proximity graphs which deserves to be better known to applied probabilists and statisticians. We introduce and motivate…
We study the basic properties of a prime sum graph, which is a simple graph defined on $\mathbb N$ where two vertices are adjacent if and only if their sum is a prime number. Further, we investigate some specific structures that appear…
A. Reid showed that if $\Gamma_1$ and $\Gamma_2$ are arithmetic lattices in $G = \operatorname{PGL}_2(\mathbb R)$ or in $\operatorname{PGL}_2(\mathbb C)$ which give rise to isospectral manifolds, then $\Gamma_1$ and $\Gamma_2$ are…
Motivated by an open problem from graph drawing, we study several partitioning problems for line and hyperplane arrangements. We prove a ham-sandwich cut theorem: given two sets of n lines in R^2, there is a line l such that in both line…
A list assignment $L$ for a graph $G$ is an $(\ell,k)$-list assignment if $|L(v)|\geq \ell$ for each $v \in V(G)$ and $|L(u) \cap L(v)| \leq k$ for each $uv \in E(G)$. We say $G$ is $(\ell,k)$-choosable if it admits an $L$-colouring for…
We show that deciding whether a given graph $G$ of size $m$ has a unique perfect matching as well as finding that matching, if it exists, can be done in time $O(m)$ if $G$ is either a cograph, or a split graph, or an interval graph, or…
Removing all connections between two vertices s and z in a graph by removing a minimum number of vertices is a fundamental problem in algorithmic graph theory. This (s,z)-separation problem is well-known to be polynomial solvable and serves…
We show that an arbitrary infinite graph $G$ can be compactified by its ends plus its critical vertex sets, where a finite set $X$ of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
Directed acyclic graphs whose nodes are all the divisors of a positive integer $n$ and arcs $(a,b)$ defined by $a$ divides $b$ are considered. Fourteen graph invariants such as order, size, and the number of paths are investigated for two…
A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…
We reprove and extend a result of David Krebes (J. Knot Theory Ramif. 8 (1999), 321-352) giving an obstruction to embedding a tangle T into a link L. Closing the tangle up in the two obvious ways gives rise to two links, the numerator and…
We prove that sparse string graphs in a fixed surface have linear expansion. We extend this result to the more general setting of sparse region intersection graphs over any proper minor-closed class. The proofs are combinatorial and…
In this paper, we show that projective special linear groups $S:=L_3(q)$ with $q$ less than $100$ are uniquely determined by their orders and degree patterns of their prime graphs. Indeed, we prove that if $G$ is a finite group whose order…
Let $G = (V, E)$ be a graph and $\lambda $ a non-negative integer. A graph $G$ is called a $(\lambda, 1)$-{\em graph} if $ (c0)$ $G$ is neither a complete graph no an edge-empty graph, $ (c1)$ every edge in $G$ belongs to exactly $\lambda$…
We present sweeping line graphs, a generalization of $\Theta$-graphs. We show that these graphs are spanners of the complete graph, as well as of the visibility graph when line segment constraints or polygonal obstacles are considered. Our…
Every knot has a plat projection, obtained by closing up a braid with bridges. The plat projection is determined by the number of strands and the number of rows of twist regions in the braid, and an integer number of crossings in each twist…
Let L be the Leavitt path algebra of an arbitrary directed graph E over a field K. This survey article describes how this highly non-commutative ring L shares a number of the characterizing properties of a Dedekind domain or a Pr\"ufer…
Lov\'asz conjectured that every connected 4-regular planar graph G admits a realization as a system of circles, i.e., it can be drawn on the plane utilizing a set of circles, such that the vertices of G correspond to the intersection and…
An ordered and oriented 2-component link L in the 3-sphere is said to be achiral if it is ambient isotopic to its mirror image ignoring the orientation and ordering of the components. Kirk-Livingston showed that if L is achiral then the…