On the public citation graph

Quasi-planar graphs have a linear number of edges

https://doi.org/10.1007/bf01196127

0 signed · 129 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118033203openalex-snapshot

Combinatorial Geometry

inferredcites →https://doi.org/10.1016/0012-365x(85)90044-5openalex-snapshot

On the chromatic number of multiple interval graphs and overlap graphs

inferredcites →https://doi.org/10.1016/0012-365x(85)90045-7openalex-snapshot

Covering and coloring problems for relatives of intervals

inferredcites →https://doi.org/10.1016/0095-8956(92)90003-gopenalex-snapshot

A turán-type theorem on chords of a convex polygon

inferredcites →https://doi.org/10.1017/cbo9781139164849.009openalex-snapshot

Algorithmic Graph Theory

inferredcites →https://doi.org/10.1145/177424.177629openalex-snapshot

Applications of the crossing number

inferredcites →https://doi.org/10.5860/choice.33-5161openalex-snapshot

Combinatorial geometry

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.1999.1049openalex-snapshot

On Crossing Sets, Disjoint Sets, and Pagenumber

inferred← citeshttps://doi.org/10.1007/11589440_19openalex-snapshot

Crossing Stars in Topological Graphs

inferred← citeshttps://doi.org/10.1007/3-540-36151-0_28openalex-snapshot

Geometric Graphs with No Self-intersecting Path of Length Three

inferred← citeshttps://doi.org/10.1007/3-540-45471-3_14openalex-snapshot

On Neighbors in Geometric Permutations

inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_1openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_15openalex-snapshot

On Disjoint Crossing Families in Geometric Graphs

inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_29openalex-snapshot

Construction of Locally Plane Graphs with Many Edges

inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_9openalex-snapshot

On RAC Drawings of Graphs with One Bend per Edge

inferred← citeshttps://doi.org/10.1007/978-3-030-10801-4_21openalex-snapshot

On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge

inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0openalex-snapshot

Graph Drawing and Network Visualization

inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_20openalex-snapshot

Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity

inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_21openalex-snapshot

The QuaSEFE Problem

inferred← citeshttps://doi.org/10.1007/978-3-030-68766-3_32openalex-snapshot

2-Layer k-Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_4openalex-snapshot

Simplifying Non-simple Fan-Planar Drawings

inferred← citeshttps://doi.org/10.1007/978-3-031-22203-0_16openalex-snapshot

Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem

inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_2openalex-snapshot

The Family of Fan-Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-031-49272-3_3openalex-snapshot

Min-k-planar Drawings of Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_9openalex-snapshot

New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_22openalex-snapshot

On Bar (1,j)-Visibility Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_24openalex-snapshot

On the Size of Planarly Connected Crossing Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_25openalex-snapshot

Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time

inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_27openalex-snapshot

On the Density of Non-simple 3-Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_5openalex-snapshot

On the Relationship Between k-Planar and k-Quasi-Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_39openalex-snapshot

Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count

inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_40openalex-snapshot

1-Fan-Bundle-Planar Drawings of Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_41openalex-snapshot

Gap-Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_8openalex-snapshot

Noncrossing Hamiltonian Paths in Geometric Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-30540-8_15openalex-snapshot

Disjoint Edges in Topological Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_12openalex-snapshot

Relaxing Planarity for Topological Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-44400-8_24openalex-snapshot

Relaxing Planarity for Topological Graphs

inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_12openalex-snapshot

Extremal Configurations and Levels in Pseudoline Arrangements

inferred← citeshttps://doi.org/10.1007/978-3-540-46515-7_23openalex-snapshot

Crossing Numbers

inferred← citeshttps://doi.org/10.1007/978-3-540-77200-2_4openalex-snapshot

Erdős-Hajnal-type Results on Intersection Patterns of Geometric Objects

inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_16openalex-snapshot

A Linear Kernel for Planar Feedback Vertex Set

inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_19openalex-snapshot

Drawing Graphs with Right Angle Crossings

inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_13openalex-snapshot

Connected Feedback Vertex Set in Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_17openalex-snapshot

The Beginnings of Geometric Graph Theory

inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_16openalex-snapshot

On the Number of Edges of Fan-Crossing Free Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_4openalex-snapshot

On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs

inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_16openalex-snapshot

Fan-Planar Graphs: Combinatorial Properties and Complexity Results

inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_17openalex-snapshot

On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs

inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_5openalex-snapshot

Planar and Quasi Planar Simultaneous Geometric Embedding

inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_29openalex-snapshot

Testing Full Outer-2-planarity in Linear Time

inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_1openalex-snapshot

Beyond Planar Graphs: Introduction

inferred← citeshttps://doi.org/10.1007/978-981-15-6533-5_3openalex-snapshot

Quasi-planar Graphs

inferred← citeshttps://doi.org/10.1007/bf02086610openalex-snapshot

Applications of the crossing number

inferred← citeshttps://doi.org/10.1007/bfb0009486openalex-snapshot

Extremal problems for geometric hypergraphs

inferred← citeshttps://doi.org/10.1007/pl00009365openalex-snapshot

Extremal Problems for Geometric Hypergraphs

inferred← citeshttps://doi.org/10.1007/s00373-005-0616-1openalex-snapshot

Topological Graphs with No Large Grids

inferred← citeshttps://doi.org/10.1007/s00373-013-1335-7openalex-snapshot

The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges

inferred← citeshttps://doi.org/10.1007/s00373-020-02133-4openalex-snapshot

Twenty Years of Progress of $$\hbox {JCDCG}^3$$

inferred← citeshttps://doi.org/10.1007/s00453-014-9935-zopenalex-snapshot

On the Number of Edges of Fan-Crossing Free Graphs

inferred← citeshttps://doi.org/10.1007/s00453-016-0200-5openalex-snapshot

On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs

inferred← citeshttps://doi.org/10.1007/s00454-005-1191-1openalex-snapshot

Geometric Graphs with No Three Disjoint Edges

inferred← citeshttps://doi.org/10.1007/s00454-006-1260-0openalex-snapshot

Covering Planar Graphs with a Fixed Number of Balls

inferred← citeshttps://doi.org/10.1007/s00454-009-9143-9openalex-snapshot

On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges

inferred← citeshttps://doi.org/10.1007/s00454-014-9594-5openalex-snapshot

Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls

inferred← citeshttps://doi.org/10.1007/s00454-018-0031-zopenalex-snapshot

Coloring Curves that Cross a Fixed Curve

inferred← citeshttps://doi.org/10.1007/s00454-021-00327-yopenalex-snapshot

Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs

inferred← citeshttps://doi.org/10.1007/s00493-016-3414-xopenalex-snapshot

On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations

inferred← citeshttps://doi.org/10.1007/s00493-017-3792-8openalex-snapshot

On the Size of K-Cross-Free Families

inferred← citeshttps://doi.org/10.1007/s00493-020-4423-3openalex-snapshot

Packing and Covering Balls in Graphs Excluding a Minor

inferred← citeshttps://doi.org/10.1007/s10958-014-1690-9openalex-snapshot

An Upper Bound on the Number of Edges in an Almost Planar Bipartite Graph

inferred← citeshttps://doi.org/10.1016/j.aim.2021.107779openalex-snapshot

Planar point sets determine many pairwise crossing segments

inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.06.001openalex-snapshot

New bounds on the maximum number of edges in k-quasi-planar graphs

inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.10.002openalex-snapshot

On the edge crossing properties of Euclidean minimum weight Laman graphs

inferred← citeshttps://doi.org/10.1016/j.comgeo.2026.102255openalex-snapshot

Optimal right angles crossing graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2005.12.010openalex-snapshot

Noncrossing Hamiltonian paths in geometric graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.018openalex-snapshot

A linear-time algorithm for testing full outer-2-planarity

inferred← citeshttps://doi.org/10.1016/j.ejc.2003.09.019openalex-snapshot

Geometric graphs with no self-intersecting path of length three

inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.021openalex-snapshot

Coloring K k -free intersection graphs of geometric objects in the plane

inferred← citeshttps://doi.org/10.1016/j.jcta.2006.08.002openalex-snapshot

On the maximum number of edges in quasi-planar graphs

inferred← citeshttps://doi.org/10.1016/j.jcta.2009.03.008openalex-snapshot

Extremal problems on triangle areas in two and three dimensions

inferred← citeshttps://doi.org/10.1016/j.jctb.2019.08.006openalex-snapshot

Simple k-planar graphs are simple (k + 1)-quasiplanar

inferred← citeshttps://doi.org/10.1016/j.tcs.2011.05.025openalex-snapshot

Drawing graphs with right angle crossings

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.04.020openalex-snapshot

Fan-planarity: Properties and complexity

inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.026openalex-snapshot

Recognizing and drawing IC-planar graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.005openalex-snapshot

1-Fan-bundle-planar drawings of graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.05.029openalex-snapshot

Gap-planar graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.04.018openalex-snapshot

On RAC drawings of graphs with one bend per edge

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.002openalex-snapshot

On fan-crossing graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.031openalex-snapshot

Fan-crossing free graphs and their relationship to other beyond-planar graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.015openalex-snapshot

Re-embedding a 1-plane graph for a straight-line drawing in linear time

inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00052-9openalex-snapshot

On neighbors in geometric permutations

inferred← citeshttps://doi.org/10.1017/s0963548313000412openalex-snapshot

Applications of a New Separator Theorem for String Graphs

inferred← citeshttps://doi.org/10.1023/a:1008393130864openalex-snapshot

inferred← citeshttps://doi.org/10.1090/conm/342/06141openalex-snapshot

A generalization of quasi-planarity

inferred← citeshttps://doi.org/10.1093/comjnl/bxad038openalex-snapshot

2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth

inferred← citeshttps://doi.org/10.1093/comjnl/bxv048openalex-snapshot

Planar and Quasi-Planar Simultaneous Geometric Embedding

inferred← citeshttps://doi.org/10.1093/comjnl/bxw075openalex-snapshot

Area-Thickness Trade-Offs for Straight-Line Drawings of Planar Graphs

inferred← citeshttps://doi.org/10.1109/18.669420openalex-snapshot

Some new circuit codes

inferred← citeshttps://doi.org/10.1109/18.945274openalex-snapshot

Single-track circuit codes

inferred← citeshttps://doi.org/10.1112/jlms.70324openalex-snapshot

Tight bounds for intersection‐reverse sequences, edge‐ordered graphs, and applications

inferred← citeshttps://doi.org/10.1137/050623693openalex-snapshot

Crossing Stars in Topological Graphs

inferred← citeshttps://doi.org/10.1137/110858586openalex-snapshot

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

inferred← citeshttps://doi.org/10.1137/16m1092726openalex-snapshot

Coloring Jordan Regions and Curves

inferred← citeshttps://doi.org/10.1137/17m1157374openalex-snapshot

Outerstring Graphs are $\chi$-Bounded

inferred← citeshttps://doi.org/10.1145/1137856.1137895openalex-snapshot

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

inferred← citeshttps://doi.org/10.1145/1377676.1377709openalex-snapshot

Extremal problems on triangle areas in two and three dimensions

inferred← citeshttps://doi.org/10.1145/1377676.1377735openalex-snapshot

Coloring k k -free intersection graphs of geometric objects in the plane

inferred← citeshttps://doi.org/10.1145/2582112.2582115openalex-snapshot

Outerstring graphs are χ-bounded

inferred← citeshttps://doi.org/10.1145/3747591openalex-snapshot

Minimum Plane Bichromatic Spanning Trees

inferred← citeshttps://doi.org/10.1201/b16132-53openalex-snapshot

Graphs and Finite Geometries

inferred← citeshttps://doi.org/10.1201/b16132-73openalex-snapshot

Drawings of Graphs

inferred← citeshttps://doi.org/10.21236/ada601590openalex-snapshot

A Survey of Visualization Tools Assessed for Anomaly-Based Intrusion Detection Analysis

inferred← citeshttps://doi.org/10.37236/10521openalex-snapshot

The Density of Fan-Planar Graphs

inferred← citeshttps://doi.org/10.4230/lipics.gd.2024.25openalex-snapshot

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth

inferred← citeshttps://doi.org/10.4230/lipics.gd.2024.29openalex-snapshot

Beyond-Planarity: Density Results for Bipartite Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1112.2361openalex-snapshot

The number of edges in k-quasi-planar graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1302.7228openalex-snapshot

Applications of a new separator theorem for string graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1306.4434openalex-snapshot

An Introduction to the Discharging Method via Graph Coloring

inferred← citeshttps://doi.org/10.48550/arxiv.1311.1976openalex-snapshot

On the Number of Edges of Fan-Crossing Free Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1403.8086openalex-snapshot

Covering nearly surface-embedded graphs with a fixed number of balls

inferred← citeshttps://doi.org/10.48550/arxiv.1605.02891openalex-snapshot

Path-Additions of Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1704.02175openalex-snapshot

On the size of $k$-cross-free families

inferred← citeshttps://doi.org/10.52843/cassyni.gfmg6mopenalex-snapshot

Unavoidable patterns in complete simple topological graphs

inferred← citeshttps://doi.org/10.7155/jgaa.00032openalex-snapshot

Planarizing Graphs - A Survey and Annotated Bibliography

inferred← citeshttps://doi.org/10.7155/jgaa.00427openalex-snapshot

Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem

inferred← citeshttps://doi.org/10.7155/jgaa.00453openalex-snapshot

On the size of planarly connected crossing graphs

inferred← citeshttps://doi.org/10.7155/jgaa.00463openalex-snapshot

Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs

inferred← citeshttps://doi.org/10.7155/jgaa.00618openalex-snapshot

Simplifying Non-Simple Fan-Planar Drawings

inferred← citeshttps://doi.org/10.7155/jgaa.v28i2.2925openalex-snapshot

Min-$k$-planar Drawings of Graphs

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.