Beyond-planarity: Turán-type results for non-planar bipartite graphs
From MaRDI portal
Publication:5091019
Recommendations
Cites work
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 2001186 (Why is no real title available?)
- A characterization of complete bipartite RAC graphs
- A linear-time algorithm for testing outer-1-planarity
- An upper bound on the number of edges in an almost planar bipartite graph
- Crossing-Free Subgraphs
- Disjoint edges in geometric graphs
- Drawing complete multipartite graphs on the plane with restrictions on crossings
- Drawing graphs with right angle crossings
- Efficient Planarity Testing
- Ein Sechsfarbenproblem auf der Kugel
- Fan-planarity: properties and complexity
- Graphs drawn with few crossings per edge
- Improving the crossing lemma by finding more crossings in sparse graphs
- On a problem of P. Turan concerning graphs
- On an extremal problem in the class of bipartite 1-planar graphs
- On some extremal problems in graph theory
- On the density of non-simple 3-planar graphs
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
- On topological graphs with at most four crossings per edge
- Outer 1-planar graphs
- Quasi-planar graphs have a linear number of edges
- Re-embeddings of Maximum 1-Planar Graphs
- Recognizing optimal 1-planar graphs in linear time
- Right angle crossing graphs and 1-planarity
- Straight-line grid drawings of 3-connected 1-planar graphs
- The number of edges in \(k\)-quasi-planar graphs
- The straight-line RAC drawing problem is NP-hard
- The structure of plane graphs with independent crossings and its applications to coloring problems
- Two-Planar Graphs Are Quasiplanar
Cited in
(11)- Re-embedding a 1-plane graph for a straight-line drawing in linear time
- An annotated review on graph drawing and its applications
- On RAC drawings of graphs with one bend per edge
- 2-Layer k-Planar Graphs
- Efficient generation of different topological representations of graphs beyond-planarity
- On optimal beyond-planar graphs
- Efficient generation of different topological representations of graphs beyond-planarity
- Fan-planar graphs
- \(k\)-planar graphs
- On plane bipartite graphs without fixed edges
- The thickness of fan-planar graphs is at most three
This page was built for publication: Beyond-planarity: Turán-type results for non-planar bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091019)
