An upper bound on the number of edges in an almost planar bipartite graph

DOI10.1007/s10958-014-1690-9zbMath1298.05087arXiv1307.1013OpenAlexW3102811455MaRDI QIDQ744552

D. Kharzeev

Publication date: 25 September 2014

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.1013

zbMATH Keywords

drawings of complete bipartite graphs on a plane

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (8)

On the Size of Matchings in 1-Planar Graph with High Minimum Degree ⋮ An annotated bibliography on 1-planarity ⋮ On an extremal problem in the class of bipartite 1-planar graphs ⋮ Unnamed Item ⋮ On the sizes of bipartite 1-planar graphs ⋮ 1-Planar Graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs ⋮ A note on the upper bounds on the size of bipartite and tripartite 1-embeddable graphs on surfaces

Cites Work

• On the maximum number of edges in quasi-planar graphs
• On the maximum number of edges in topological graphs with no four pairwise crossing edges
• Graphs drawn with few crossings per edge
• Quasi-planar graphs have a linear number of edges
• Geometric graphs with no self-intersecting path of length three
• Crossing Stars in Topological Graphs

This page was built for publication: An upper bound on the number of edges in an almost planar bipartite graph