Pages that link to "Item:Q1014335"
From MaRDI portal
The following pages link to On the maximum number of edges in topological graphs with no four pairwise crossing edges (Q1014335):
Displaying 35 items.
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← 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 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)
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- A linear-time algorithm for testing full outer-2-planarity (Q1727743) (← 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)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- On topological graphs with at most four crossings per edge (Q2175439) (← links)
- Triangle-free geometric intersection graphs with no large independent sets (Q2256591) (← 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)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
- On the Number of Edges of Fan-Crossing Free Graphs (Q2872081) (← links)
- On the Size of Planarly Connected Crossing Graphs (Q2961524) (← links)
- Beyond Outerplanarity (Q4625142) (← links)
- Beyond Planar Graphs: Introduction (Q5001653) (← links)
- Quantitative Restrictions on Crossing Patterns (Q5001654) (← links)
- Quasi-planar Graphs (Q5001655) (← links)
- 2-Layer k-Planar Graphs (Q5014133) (← links)
- (Q5091019) (← links)
- Two-Planar Graphs Are Quasiplanar (Q5111262) (← links)
- Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (Q5115768) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Counting Plane Graphs: Cross-Graph Charging Schemes (Q5397740) (← links)
- Applications of a New Separator Theorem for String Graphs (Q5414146) (← links)
- On RAC drawings of graphs with one bend per edge (Q5915940) (← links)
- On RAC drawings of graphs with one bend per edge (Q5918835) (← links)
