Pages that link to "Item:Q1375051"
From MaRDI portal
The following pages link to Quasi-planar graphs have a linear number of edges (Q1375051):
Displaying 50 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Drawing graphs with right angle crossings (Q719252) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- Covering nearly surface-embedded graphs with a fixed number of balls (Q741614) (← 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)
- On the maximum number of edges in quasi-planar graphs (Q878960) (← links)
- Noncrossing Hamiltonian paths in geometric graphs (Q885281) (← links)
- On the edge crossing properties of Euclidean minimum weight Laman graphs (Q902420) (← links)
- New bounds on the maximum number of edges in \(k\)-quasi-planar graphs (Q904085) (← links)
- On the maximum number of edges in topological graphs with no four pairwise crossing edges (Q1014335) (← links)
- Extremal problems on triangle areas in two and three dimensions (Q1040833) (← links)
- On neighbors in geometric permutations. (Q1398279) (← links)
- 1-fan-bundle-planar drawings of graphs (Q1708027) (← links)
- A linear-time algorithm for testing full outer-2-planarity (Q1727743) (← links)
- Gap-planar graphs (Q1786592) (← links)
- Geometric graphs with no self-intersecting path of length three (Q1883291) (← links)
- Applications of the crossing number (Q1920423) (← links)
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar (Q1985441) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- Packing and covering balls in graphs excluding a minor (Q2043760) (← links)
- The density of fan-planar graphs (Q2121760) (← links)
- Simplifying non-simple fan-planar drawings (Q2151431) (← links)
- On fan-crossing graphs (Q2202017) (← links)
- Efficient generation of different topological representations of graphs beyond-planarity (Q2206855) (← links)
- The QuaSEFE problem (Q2206856) (← links)
- Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Fan-planarity: properties and complexity (Q2346379) (← links)
- On the recognition of fan-planar and maximal outer-fan-planar graphs (Q2408919) (← links)
- Coloring curves that cross a fixed curve (Q2415382) (← links)
- Topological graphs with no large grids (Q2573803) (← links)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
- (Q2857373) (← links)
- On the Number of Edges of Fan-Crossing Free Graphs (Q2872081) (← links)
- On the Size of Planarly Connected Crossing Graphs (Q2961524) (← links)
- On the Density of Non-simple 3-Planar Graphs (Q2961527) (← links)
- Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem (Q2985117) (← links)
- Drawing Graphs with Right Angle Crossings (Q3183456) (← links)
- k-Quasi-Planar Graphs (Q3223960) (← links)
- A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (Q4625139) (← links)
- Gap-Planar Graphs (Q4625141) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
- Beyond Planar Graphs: Introduction (Q5001653) (← links)
- Quasi-planar Graphs (Q5001655) (← links)
- 2-Layer k-Planar Graphs (Q5014133) (← links)
