Add to ORKGThe crossing number $cr(G)$ of a graph $G$ is the minimum number of crossings over all possible drawings of $G$ on the plane. According to the Crossing Lemma, for any simple graph $G$ with $n$ vertices and $e\ge 4n$ edges, $cr(G)\ge {1\over 64}{e^3\over n^2}$. Clearly, this result does not hold for multigraphs (graphs with parallel edges or loops). We find natural conditions that imply the analogue of the Crossing Lemma for multigraphs.Non UBCUnreviewedAuthor affiliation: Renyi Institute of MathematicsFacult
The crossing number cr( $G$) of a graph $G$, is the smallest possible number of edge-crossings in a ...
The crossing number cr( $G$) of a graph $G$, is the smallest possible number of edge-crossings in a ...
The crossing number CR(G) of a graph G = (V, E) is the smallest number of edge crossings over all dr...
Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross...
Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross...
The crossing number, cr(G), of a graph G is the least number of cross-ing points in any drawing of G...
The crossing number of a graph G, cr(G) is the minimum number of intersections among edges over all ...
The celebrated Crossing Lemma states that, in every drawing of a graph with n vertices and m geq 4n ...
The celebrated Crossing Lemma states that, in every drawing of a graph with n vertices and m geq 4n ...
The crossing number of a graph G=(V,E), denoted by cr(G), is the smallest number of edge crossings i...
The pair-crossing number of a graph G, pcr(G), is the minimum possible number of pairs of edges that...
The pair-crossing number of a graph G, pcr(G), is the minimum possible number of pairs of edges that...
The crossing number of a graph G=(V,E), denoted by cr(G), is the smallest number of edge crossings i...
The crossing number CR() of a graph =(,) is the smallest number of edge crossings over all drawi...
The crossing number of a graph G = (V, E), denoted by cr(G), is the smallest number of edge crossing...
The crossing number cr( $G$) of a graph $G$, is the smallest possible number of edge-crossings in a ...
The crossing number cr( $G$) of a graph $G$, is the smallest possible number of edge-crossings in a ...
The crossing number CR(G) of a graph G = (V, E) is the smallest number of edge crossings over all dr...
Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross...
Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross...
The crossing number, cr(G), of a graph G is the least number of cross-ing points in any drawing of G...
The crossing number of a graph G, cr(G) is the minimum number of intersections among edges over all ...
The celebrated Crossing Lemma states that, in every drawing of a graph with n vertices and m geq 4n ...
The celebrated Crossing Lemma states that, in every drawing of a graph with n vertices and m geq 4n ...
The crossing number of a graph G=(V,E), denoted by cr(G), is the smallest number of edge crossings i...
The pair-crossing number of a graph G, pcr(G), is the minimum possible number of pairs of edges that...
The pair-crossing number of a graph G, pcr(G), is the minimum possible number of pairs of edges that...
The crossing number of a graph G=(V,E), denoted by cr(G), is the smallest number of edge crossings i...
The crossing number CR() of a graph =(,) is the smallest number of edge crossings over all drawi...
The crossing number of a graph G = (V, E), denoted by cr(G), is the smallest number of edge crossing...
The crossing number cr( $G$) of a graph $G$, is the smallest possible number of edge-crossings in a ...
The crossing number cr( $G$) of a graph $G$, is the smallest possible number of edge-crossings in a ...
The crossing number CR(G) of a graph G = (V, E) is the smallest number of edge crossings over all dr...