On the Number of Edges of Fan-Crossing Free Graphs (Q2872081): Difference between revisions

Latest revision as of 10:46, 11 July 2024

scientific article; zbMATH DE number 6542942

On the number of edges of fan-crossing free graphs

Language	Label	Description	Also known as
English	On the Number of Edges of Fan-Crossing Free Graphs	scientific article; zbMATH DE number 6542942	On the number of edges of fan-crossing free graphs

Statements

instance of

scholarly article

0 references

title

On the Number of Edges of Fan-Crossing Free Graphs (English)

0 references

On the number of edges of fan-crossing free graphs (English)

0 references

0 references

0 references

0 references

0 references

Algorithms and Computation

0 references

Algorithmica

0 references

publication date

14 January 2014

0 references

19 February 2016

0 references

full work available at URL

https://arxiv.org/abs/1311.1976

0 references

zbMATH Keywords

graph theory

0 references

graph drawing

0 references

planar graph

0 references

extremal graph

0 references

$K$-planar graphs

0 references

crossing number

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

On the maximum number of edges in topological graphs with no four pairwise crossing edges

0 references

Quasi-planar graphs have a linear number of edges

0 references

The Straight-Line RAC Drawing Problem is NP-Hard

0 references

Density of straight-line 1-planar graph drawings

0 references

Drawing graphs with right angle crossings

0 references

Right angle crossing graphs and 1-planarity

0 references

The Number of Edges in $k$-Quasi-planar Graphs

0 references

Algorithms for graphs embeddable with few crossings per edge

0 references

Fáry’s Theorem for 1-Planar Graphs

0 references

Topological graphs with no large grids

0 references

Improving the crossing lemma by finding more crossings in sparse graphs

0 references

Discrete and Computational Geometry

0 references

Applications of the crossing number

0 references

Graphs drawn with few crossings per edge

0 references

Identifiers

zbMATH Open document ID

1329.05079

0 references

1330.05048

0 references

DOI

10.1007/978-3-642-45030-3_16

0 references

10.1007/s00453-014-9935-z

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2872081

@@ Property / cites work @@
+On the maximum number of edges in topological graphs with no four pairwise crossing edges
+Normal rank
@@ Property / cites work @@
+Quasi-planar graphs have a linear number of edges
@@ Property / cites work: Quasi-planar graphs have a linear number of edges / rank @@
+Normal rank
@@ Property / cites work @@
+The Straight-Line RAC Drawing Problem is NP-Hard
@@ Property / cites work: The Straight-Line RAC Drawing Problem is NP-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Density of straight-line 1-planar graph drawings
@@ Property / cites work: Density of straight-line 1-planar graph drawings / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing graphs with right angle crossings
@@ Property / cites work: Drawing graphs with right angle crossings / rank @@
+Normal rank
@@ Property / cites work @@
+Right angle crossing graphs and 1-planarity
@@ Property / cites work: Right angle crossing graphs and 1-planarity / rank @@
+Normal rank
@@ Property / cites work @@
+The Number of Edges in $k$-Quasi-planar Graphs
@@ Property / cites work: The Number of Edges in $k$-Quasi-planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for graphs embeddable with few crossings per edge
+Normal rank
@@ Property / cites work @@
+Fáry’s Theorem for 1-Planar Graphs
@@ Property / cites work: Fáry’s Theorem for 1-Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Topological graphs with no large grids
@@ Property / cites work: Topological graphs with no large grids / rank @@
+Normal rank
@@ Property / cites work @@
+Improving the crossing lemma by finding more crossings in sparse graphs
+Normal rank
@@ Property / cites work @@
+Discrete and Computational Geometry
@@ Property / cites work: Discrete and Computational Geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of the crossing number
@@ Property / cites work: Applications of the crossing number / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs drawn with few crossings per edge
@@ Property / cites work: Graphs drawn with few crossings per edge / rank @@
+Normal rank