Related papers: Self-graphing equations
Letters $x$ and $y$ alternate in a word $w$ if after deleting in $w$ all letters but the copies of $x$ and $y$ we either obtain a word $xyxy\cdots$ (of even or odd length) or a word $yxyx\cdots$ (of even or odd length). A graph $G=(V,E)$ is…
While graphs and abstract data structures can be large and complex, practical instances are often regular or highly structured. If the instance has sufficient structure, we might hope to compress the object into a more succinct…
The Goldberg-Sachs theorem is generalized for all four-dimensional manifolds endowed with torsion-free connection compatible with the metric, the treatment includes all signatures as well as complex manifolds. It is shown that when the Weyl…
Let X and Y be compact, simply connected and locally connected subsets of R^2, and let f : X -> Y be a homeomorphism isotopic to the identity on X. Generalizing Brouwer's plane translation theorem for self-maps of the plane, we prove that f…
We study self-consistent cosmological solutions for an Einstein Universe in a graph-based induced gravity model. The graph-based field theory has been proposed by the present authors to generalize dimensional deconstruction. In this paper,…
Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…
Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of planar graphs, very little is known about the existence of…
These lecture notes are a personal introduction to signed graphs, concentrating on the aspects that have been most persistently interesting to me. They are just a few corners of signed graph theory; I am leaving out a great deal. The…
A visualized graph is a powerful tool for data analysis and synthesis tasks. In this case, the task of visualization constitutes not only in displaying vertices and edges according to the graph representation, but also in ensuring that the…
A new approach is suggested to characterize algebraically automorphisms of the category of free algebras of a given variety. It gives in many cases an answer to the problem set by the first of authors, if automorphisms of such a category…
Dotted graphs are certain finite graphs with vertices of degree 2 called dots in the $xy$-plane $\mathbb{R}^2$, and a dotted graph is said to be admissible if it is associated with a lattice polytope in $\mathbb{R}^2$ each of whose edge is…
We present proofs of basic results, including those developed by Harold Bell, for the plane fixed point problem: does every map of a non-separating plane continuum have a fixed point? Some of these results had been announced much earlier by…
Given two irreducible curves of the plane which have isomorphic complements, it is natural to ask whether there exists an automorphism of the plane that sends one curve on the other. This question has a positive answer for a large family of…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…
In this paper we investigate invertibility of graphs with a unique perfect matching, i.e. graphs having a unique 1-factor. We recall the new notion of the so-called negatively invertible graphs investigated by the authors in the recent…
The graph isomorphism problem is of practical importance, as well as being a theoretical curiosity in computational complexity theory in that it is not known whether it is $NP$-complete or $P$. However, for many graphs, the problem is…
The existence of singularities of the solution for a class of Lax equations is investigated using a development of the fac- torization method first proposed by Semenov-Tian-Shansky and Reymann [11], [9]. It is shown that the existence of a…
Causality has traditionally been a scientific way to generate knowledge by relating causes to effects. From an imaginery point of view, causal graphs are a helpful tool for representing and infering new causal information. In previous…
Graphs are used to represent a plethora of phenomena, from the Web and social networks, to biological pathways, to semantic knowledge bases. Arguably the most interesting and important questions one can ask about graphs have to do with…