On the public citation graph

On representations of some thickness-two graphs

https://doi.org/10.1007/bfb0021815
0 signed · 29 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/jgt.3190120306openalex-snapshot
Rectilinear drawings of graphs
inferredcites →https://doi.org/10.1007/3-540-51542-9_28openalex-snapshot
Weighted visibility graphs of bars and related flow problems
inferredcites →https://doi.org/10.1007/3-540-58950-3_367openalex-snapshot
Rectangle-visibility representations of bipartite graphs
inferredcites →https://doi.org/10.1007/3-540-62495-3_35openalex-snapshot
On rectangle visibility graphs
inferredcites →https://doi.org/10.1007/978-3-642-65609-5openalex-snapshot
Vorlesungen über die Theorie der Polyeder
inferredcites →https://doi.org/10.1007/bf02187705openalex-snapshot
A unified approach to visibility representations of planar graphs
inferredcites →https://doi.org/10.1016/s1385-7258(63)50055-9openalex-snapshot
The thickness of a graph
inferredcites →https://doi.org/10.1017/s030500410006028xopenalex-snapshot
Determining the thickness of graphs is NP-hard
inferredcites →https://doi.org/10.1038/scientificamerican0280-14openalex-snapshot
Mathematical Games
inferredcites →https://doi.org/10.1080/0025570x.1993.11996124openalex-snapshot
Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon
inferredcites →https://doi.org/10.1090/s0002-9904-1962-10850-7openalex-snapshot
Every planar graph with nine points has a nonplanar complement
inferredcites →https://doi.org/10.1109/sfcs.1975.3openalex-snapshot
An application of graph coloring to printed circuit testing
inferredcites →https://doi.org/10.1145/323233.323253openalex-snapshot
Characterizing bar line-of-sight graphs
inferredcites →https://doi.org/10.4153/cmb-1963-026-xopenalex-snapshot
The Non-Biplanar Character of the Complete 9-Graph

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-36494-3_4openalex-snapshot
Rectangle Visibility Graphs: Characterization, Construction, and Compaction
inferred← citeshttps://doi.org/10.1007/3-540-44541-2_33openalex-snapshot
A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_367openalex-snapshot
Rectangle-visibility representations of bipartite graphs
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_35openalex-snapshot
On rectangle visibility graphs
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_45openalex-snapshot
2-Visibility drawings of planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_4openalex-snapshot
Area-efficient static and incremental graph drawings
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_69openalex-snapshot
The wobbly logic engine: Proving hardness of non-rigid geometric graph representation problems
inferred← citeshttps://doi.org/10.1007/bfb0021783openalex-snapshot
Graph Drawing
inferred← citeshttps://doi.org/10.1007/s00453-025-01351-7openalex-snapshot
Geometric Thickness of Multigraphs is $$\exists \mathbb {R}$$-Complete
inferred← citeshttps://doi.org/10.1007/s00454-007-1318-7openalex-snapshot
Graph Treewidth and Geometric Thickness Parameters
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00029-7openalex-snapshot
Rectangle-visibility representations of bipartite graphs
inferred← citeshttps://doi.org/10.1145/1490270.1490274openalex-snapshot
Directed Planar Reachability Is in Unambiguous Log-Space
inferred← citeshttps://doi.org/10.1145/1497290.1497291openalex-snapshot
Testing bipartiteness of geometric intersection graphs
inferred← citeshttps://doi.org/10.37236/1029openalex-snapshot
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
inferred← citeshttps://doi.org/10.7155/jgaa.00330openalex-snapshot
1-Visibility Representations of 1-Planar 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.