Pages that link to "Item:Q878960"
From MaRDI portal
The following pages link to On the maximum number of edges in quasi-planar graphs (Q878960):
Displaying 45 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Graphs that admit right angle crossing drawings (Q419368) (← links)
- Drawing graphs with right angle crossings (Q719252) (← links)
- The maximum number of edges in geometric graphs with pairwise virtually avoiding edges (Q742617) (← links)
- An upper bound on the number of edges in an almost planar bipartite graph (Q744552) (← links)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- On the maximum number of edges in topological graphs with no four pairwise crossing edges (Q1014335) (← links)
- Multitriangulations as complexes of star polygons (Q1017914) (← links)
- Extremal problems on triangle areas in two and three dimensions (Q1040833) (← links)
- 1-fan-bundle-planar drawings of graphs (Q1708027) (← links)
- Gap-planar graphs (Q1786592) (← links)
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar (Q1985441) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- The density of fan-planar graphs (Q2121760) (← links)
- Simplifying non-simple fan-planar drawings (Q2151431) (← links)
- On topological graphs with at most four crossings per edge (Q2175439) (← links)
- On fan-crossing graphs (Q2202017) (← links)
- Efficient generation of different topological representations of graphs beyond-planarity (Q2206855) (← links)
- The QuaSEFE problem (Q2206856) (← links)
- Fan-planarity: properties and complexity (Q2346379) (← links)
- \(\mathsf{NIC}\)-planar graphs (Q2410219) (← links)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
- Grid obstacle representation of graphs (Q2663991) (← links)
- On the Size of Planarly Connected Crossing Graphs (Q2961524) (← links)
- Graphs that Admit Right Angle Crossing Drawings (Q3057620) (← links)
- Drawing Graphs with Right Angle Crossings (Q3183456) (← links)
- k-Quasi-Planar Graphs (Q3223960) (← links)
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (Q4625139) (← links)
- Gap-Planar Graphs (Q4625141) (← links)
- Beyond Outerplanarity (Q4625142) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
- Quantitative Restrictions on Crossing Patterns (Q5001654) (← links)
- Quasi-planar Graphs (Q5001655) (← links)
- Fan-Planar Graphs (Q5001660) (← links)
- 2-Layer k-Planar Graphs (Q5014133) (← links)
- Two-Planar Graphs Are Quasiplanar (Q5111262) (← links)
- Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity (Q5141643) (← links)
- Counting Plane Graphs: Cross-Graph Charging Schemes (Q5397740) (← links)
- Simplifying Non-Simple Fan-Planar Drawings (Q5886039) (← links)
- On RAC drawings of graphs with one bend per edge (Q5915940) (← links)
- Crossing numbers of beyond-planar graphs (Q5918404) (← links)
- On RAC drawings of graphs with one bend per edge (Q5918835) (← links)
- Graphs with large total angular resolution (Q5918989) (← links)
- Graphs with large total angular resolution (Q5925608) (← links)
- (Q6179340) (← links)
