Add to ORKGWe show that the complete graph on ten vertices K10 is a simple quasi-planar graph, which answers a question of Ackerman and Tardos [E. Ackerman and G. Tardos, On the maximum number of edges in quasi-planar graphs, J. Comb. Theory, Series A 114 (2007) 563–571]and shows that the bound 6.5n−20 on the maximum number of edges of simple quasi-planar graphs is tight for n=10
A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It i...
In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex. Fan-planar...
In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex. Fan-planar...
We show that the complete graph on ten vertices K10 is a simple quasi-planar graph, which answers a ...
A graph drawn in the plane is called k-quasi-planar if it does not contain k pairwise crossing edges...
AbstractA topological graph is quasi-planar, if it does not contain three pairwise crossing edges. A...
A graph is called quasi-planar if it can be drawn in the plane so that no three of its edges are pai...
A graph is called quasi-planar if it can be drawn in the plane so that no three of its edges are pai...
A topological graph is k-quasi-planar if it does not contain k pairwise crossing edges. An old conje...
A topological graph is k-quasi-planar if it does not contain k pairwise crossing edges. A topologica...
A k-planar graph is a graph that can be drawn in the plane such that every edge is crossed at most k...
A topological drawing of a graph is fan-planar if for each edge e the edges crossing e have a common...
A graph is $k$-planar $(k \geq 1)$ if it can be drawn in the plane such that no edge is crossed more...
Every finite graph admits a simple (topological) drawing, that is, a drawing where every pair of edg...
Abstract. According to Euler’s formula, every planar graph with n vertices has at most O(n) edges. H...
A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It i...
In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex. Fan-planar...
In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex. Fan-planar...
We show that the complete graph on ten vertices K10 is a simple quasi-planar graph, which answers a ...
A graph drawn in the plane is called k-quasi-planar if it does not contain k pairwise crossing edges...
AbstractA topological graph is quasi-planar, if it does not contain three pairwise crossing edges. A...
A graph is called quasi-planar if it can be drawn in the plane so that no three of its edges are pai...
A graph is called quasi-planar if it can be drawn in the plane so that no three of its edges are pai...
A topological graph is k-quasi-planar if it does not contain k pairwise crossing edges. An old conje...
A topological graph is k-quasi-planar if it does not contain k pairwise crossing edges. A topologica...
A k-planar graph is a graph that can be drawn in the plane such that every edge is crossed at most k...
A topological drawing of a graph is fan-planar if for each edge e the edges crossing e have a common...
A graph is $k$-planar $(k \geq 1)$ if it can be drawn in the plane such that no edge is crossed more...
Every finite graph admits a simple (topological) drawing, that is, a drawing where every pair of edg...
Abstract. According to Euler’s formula, every planar graph with n vertices has at most O(n) edges. H...
A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It i...
In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex. Fan-planar...
In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex. Fan-planar...