Related papers: Projective Planar Cartesian Products of Graphs

In this paper, we focus on learning product graphs from multi-domain data. We assume that the product graph is formed by the Cartesian product of two smaller graphs, which we refer to as graph factors. We pose the product graph learning…

A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…

The tensor product of two ordered vector spaces can be ordered in more than one way, just as the tensor product of normed spaces can be normed in multiple ways. Two natural orderings have received considerable attention in the past, namely…

We investigate $k$-nets with $k\geq 4$ embedded in the projective plane $PG(2,\mathbb{K})$ defined over a field $\mathbb{K}$; they are line configurations in $PG(2,\mathbb{K})$ consisting of $k$ pairwise disjoint line-sets, called…

Graphs that are critical (minimal excluded minors) for embeddability in surfaces are studied. In Part I, it was shown that graphs that are critical for embeddings into surfaces of Euler genus $k$ or for embeddings into nonorientable surface…

In a book embedding of a graph G, the vertices of G are placed in order along a straight-line called spine of the book, and the edges of G are drawn on a set of half-planes, called the pages of the book, such that two edges drawn on a page…

A vertex coloring is called distinguishing if the identity is the only automorphism that can preserve it. The distinguishing threshold $\theta(G)$ of a graph $G$ is the minimum number of colors $k$ required that any arbitrary $k$-coloring…

Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…

We investigate two notions of saturation for partial planar embeddings of maximal planar graphs. Let $G = (V, E) $ be a vertex-labeled maximal planar graph on $ n $ vertices, which by definition has $3n - 6$ edges. We say that a labeled…

The theory of classical types of curves in normed planes is not strongly developed. In particular, the knowledge on existing concepts of curvatures of planar curves is widespread and not systematized in the literature. Giving a…

In this paper we present the results from a program developed by the author that finds the unitals of the known 193 projective planes of order 25.. There are several planes for which we have not found any unital. One or more than one…

We prove that the set of non-degenerate second order maximally superintegrable systems in the complex Euclidean plane carries a natural structure of a projective variety, equipped with a linear isometry group action. This is done by…

We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index $\ge 5$. In order to have the necessity part, graphs are organized into small classes so that one of homological…

We prove that every cyclically 4-edge-connected cubic graph that can be embedded in the projective plane, with the single exception of the Petersen graph, is 3-edge-colorable. In other words, the only (non-trivial) snark that can be…

We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has…

There has been significant research dedicated towards computing the crossing numbers of families of graphs resulting from the Cartesian products of small graphs with arbitrarily large paths, cycles and stars. For graphs with four or fewer…

We prove that given a planar embedding of a graph in the sphere the expansion of the graph structure by predicates encoding separation of vertices by simple cycles of the graph is dp-minimal.

Graph Laplacian learning, also known as network topology inference, is a problem of great interest to multiple communities. In Gaussian graphical models (GM), graph learning amounts to endowing covariance selection with the Laplacian…

The following theorem is proved: For all $k$-connected graphs $G$ and $H$ each with at least $n$ vertices, the treewidth of the cartesian product of $G$ and $H$ is at least $k(n -2k+2)-1$. For $n\gg k$ this lower bound is asymptotically…

We show that every convex code realizable by compact sets in the plane admits a realization consisting of polygons, and analogously every open convex code in the plane can be realized by interiors of polygons. We give factorial-type bounds…