On the sizes of bipartite 1-planar graphs

DOI10.37236/10012zbMath1465.05048arXiv2007.13308OpenAlexW3164865542MaRDI QIDQ2030739

Zhang Dong Ouyang, Fengming Dong, Yuan Qiu Huang

Publication date: 7 June 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

crossing numberbipartite 1-planar graph

Mathematics Subject Classification ID

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

Related Items (1)

On the Size of Matchings in 1-Planar Graph with High Minimum Degree

Cites Work

• 1-planarity of complete multipartite graphs
• Joins of 1-planar graphs
• Drawing complete multipartite graphs on the plane with restrictions on crossings
• An upper bound on the number of edges in an almost planar bipartite graph
• The structure of 1-planar graphs
• On an extremal problem in the class of bipartite 1-planar graphs
• Graphs drawn with few crossings per edge
• Ein Sechsfarbenproblem auf der Kugel
• An annotated bibliography on 1-planarity
• Über 1-optimale Graphen
• Rectilinear drawings of graphs
• Unnamed Item

This page was built for publication: On the sizes of bipartite 1-planar graphs