AbstractA graph is crossing-critical if deleting any edge decreases its crossing number on the plane. It is proved that, for any n ⩾ 3, there is an infinite family of 3-connected crossing-critical graphs with crossing number n
AbstractIn this paper we obtain a combinatorial lower bound δg(G) for the crossing number crg(G) of ...
The structure of all known infinite families of crossing–critical graphs has led to the conjec-ture ...
Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross...
AbstractA graph is crossing-critical if deleting any edge decreases its crossing number on the plane...
AbstractA graph is crossing-critical if deleting any edge decreases its crossing number on the plane...
A graph is crossing-critical if its crossing number decreases when we remove any of its edges. Recen...
AbstractThe crossing number of a graph G, denoted by cr(G), is defined as the smallest possible numb...
The crossing number of a graph G, denoted by cr(G), is defined as the smallest possible number of ed...
The crossing number cr( $G$) of a graph $G$, is the smallest possible number of edge-crossings in a ...
We study c-crossing-critical graphs, which are the minimal graphs that require at least c edge-cross...
Širan constructed infinite families of ▫$k$▫-crossing-critical graphs for every ▫$k ge 3$▫ and Kocho...
AbstractAn edge e of a graph G is said to be crossing-critical if cr(G − e) < cr(G), where cr(G) den...
AbstractA conjecture of Richter and Salazar about graphs that are critical for a fixed crossing numb...
AbstractWe show that every sufficiently large plane triangulation has a large collection of nested c...
AbstractIn their paper on minimal graphs with crossing number at least k (or, equivalently, k-crossi...
AbstractIn this paper we obtain a combinatorial lower bound δg(G) for the crossing number crg(G) of ...
The structure of all known infinite families of crossing–critical graphs has led to the conjec-ture ...
Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross...
AbstractA graph is crossing-critical if deleting any edge decreases its crossing number on the plane...
AbstractA graph is crossing-critical if deleting any edge decreases its crossing number on the plane...
A graph is crossing-critical if its crossing number decreases when we remove any of its edges. Recen...
AbstractThe crossing number of a graph G, denoted by cr(G), is defined as the smallest possible numb...
The crossing number of a graph G, denoted by cr(G), is defined as the smallest possible number of ed...
The crossing number cr( $G$) of a graph $G$, is the smallest possible number of edge-crossings in a ...
We study c-crossing-critical graphs, which are the minimal graphs that require at least c edge-cross...
Širan constructed infinite families of ▫$k$▫-crossing-critical graphs for every ▫$k ge 3$▫ and Kocho...
AbstractAn edge e of a graph G is said to be crossing-critical if cr(G − e) < cr(G), where cr(G) den...
AbstractA conjecture of Richter and Salazar about graphs that are critical for a fixed crossing numb...
AbstractWe show that every sufficiently large plane triangulation has a large collection of nested c...
AbstractIn their paper on minimal graphs with crossing number at least k (or, equivalently, k-crossi...
AbstractIn this paper we obtain a combinatorial lower bound δg(G) for the crossing number crg(G) of ...
The structure of all known infinite families of crossing–critical graphs has led to the conjec-ture ...
Let G be a drawing of a graph with n vertices and e > 4n edges, in which no two adjacent edges cross...
DOI
Add to ORKG