On an extremal problem in the class of bipartite 1-planar graphs
From MaRDI portal
Publication:907838
DOI10.7151/dmgt.1845zbMath1329.05081arXiv1501.00176OpenAlexW2573954756MaRDI QIDQ907838
Július Czap, Jakub Przybyło, Erika Fecková Škrabuľáková
Publication date: 26 January 2016
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.00176
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Density (toughness, etc.) (05C42)
Related Items (4)
An annotated bibliography on 1-planarity ⋮ Unnamed Item ⋮ On the sizes of bipartite 1-planar graphs ⋮ $$\textit{\textbf{k}}$$-Planar Graphs
Cites Work
- Unnamed Item
- On drawings and decompositions of 1-planar graphs
- 1-planarity of complete multipartite graphs
- An upper bound on the number of edges in an almost planar bipartite graph
- The structure of 1-planar graphs
- Graphs drawn with few crossings per edge
- Über 1-optimale Graphen
- On the Density of Maximal 1-Planar Graphs
This page was built for publication: On an extremal problem in the class of bipartite 1-planar graphs