Displaying similar documents to “A visibility representation for graphs in three dimensions.”

Bar k -visibility graphs.

Dean, Alice M., Evans, William, Gethner, Ellen, Laison, Joshua D., Safari, Mohammad Ali, Trotter, William T. (2007)

Journal of Graph Algorithms and Applications

Similarity:

On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs

Július Czap, Jakub Przybyło, Erika Škrabuľáková (2016)

Discussiones Mathematicae Graph Theory

Similarity:

A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets. Bipartite 1-planar graphs are known to have at most 3n − 8 edges, where n denotes the order of a graph. We show that maximal-size bipartite 1-planar graphs which are almost balanced have not significantly fewer edges than indicated by this upper bound, while the same...