A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
Jochen Harant, Michael A. Henning, Dieter Rautenba...
The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the lea...
Wayne Goddard, Michael A. Henning, Ortrud R. Oelle...