Related papers: The Minor Crossing Number of Graphs with an Exclud…
The crossing number of a graph $G$ is the least number of crossings over all possible drawings of $G$. We present a structural characterization of graphs with crossing number one.
The crossing number of a graph $G$, ${\mbox{cr}}(G)$, is the minimum number of crossings, the pair-crossing number, ${\mbox{pcr}}(G)$, is the minimum number of pairs of crossing edges over all drawings of $G$. In this note we show that…
The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. In this paper, we give the exact values of crossing numbers for some variations of hypercube with order at most four,…
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\Delta n)$, where $G$…
Motivated by a problem asked by Richter and by the long standing Harary-Hill conjecture, we study the relation between the crossing number of a graph $G$ and the crossing number of its cone $CG$, the graph obtained from $G$ by adding a new…
We introduce the triple crossing number, a variation of crossing number, of a graph, which is the minimal number of crossing points in all drawings with only triple crossings of the graph. It is defined to be zero for a planar graph, and to…
The crossing number of a graph $G$ is the minimum number of crossings in a drawing of $G$ in the plane. A rectilinear drawing of a graph $G$ represents vertices of $G$ by a set of points in the plane and represents each edge of $G$ by a…
The crossing number $cr(G)$ of a graph $G=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$-planar crossing number of $G$, $cr_k(G)$, is defined as the minimum of…
The crossing number of a graph $G$ is the minimum number of edge crossings over all drawings of $G$ in the plane. A graph $G$ is $k$-crossing-critical if its crossing number is at least $k$, but if we remove any edge of $G$, its crossing…
We prove that if $G$ is a graph with an minimal edge cut $F$ of size three and $G_1$, $G_2$ are the two (augmented) components of $G-F$, then the crossing number of $G$ is equal to the sum of crossing numbers of $G_1$ and $G_2$. Combining…
The n-th crossing number of a graph G, denoted cr_n(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a>b>0, there exists a graph G for which cr_0(G) = a, cr_1(G) = b, and…
The crossing number ${\mbox {cr}}(G)$ of a graph $G=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$-planar crossing number of $G$, ${\mbox {cr}}_k(G)$, is defined as the…
A drawing of a graph is {\em pseudolinear} if there is a pseudoline arrangement such that each pseudoline contains exactly one edge of the drawing. The {\em pseudolinear crossing number} of a graph $G$ is the minimum number of pairwise…
The crossing number of a graph $G$ denotes the minimum number of crossings in any planar drawing of $G$. In this short note, we confirm a long-standing conjecture posed by Pach, Spencer, and T\'oth over 25 years ago, establishing an optimal…
The crossing number of a graph is the minimum number of crossings over all of its drawings on the plane. The Crossing Lemma, proved more than 40 years ago, is a tight lower bound on the crossing number of a graph in terms of the number of…
For a set of non-negative integers $L$, the $L$-intersection number of a graph is the smallest number $l$ for which there is an assignment on the vertices to subsets $A_v \subseteq \{1,\dots, l\}$, such that every two vertices $u,v$ are…
We prove that all $1$-vertex spatial graphs with adequate diagrams have minimal crossing number, and that spatial graph diagrams obtained by replacing vertices and edges of a planar embedded graph by minimal crossing link or spatial graph…
The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. In this paper, we study the crossing numbers of $K_{m}\times P_n$ and $K_{m}\times C_n$.
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that…
The crossing number of a graph is the minimum number of double points over all generic immersions of the graph into the plane. In this paper we investigate the behavior of crossing number under a graph transformation, called $\mathsf{\Delta…