On the public citation graph

On 1-Planar Graphs with Bounded Cop-Number

https://doi.org/10.2139/ssrn.4969841
0 signed · 22 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.22542openalex-extracted
Long cycles and spanning subgraphs of locally maximal 1‐planar graphs
inferredcites →https://doi.org/10.1007/978-1-4612-1370-3_14openalex-extracted
The Copnumber of a Graph is Bounded by [3/2 genus (G)] + 3
inferredcites →https://doi.org/10.1007/978-3-031-49275-4_1openalex-extracted
Cops and Robbers on 1-Planar Graphs
inferredcites →https://doi.org/10.1007/978-981-15-6533-5openalex-extracted
Beyond Planar Graphs
inferredcites →https://doi.org/10.1007/s00453-015-0002-1openalex-extracted
Outer 1-Planar Graphs
inferredcites →https://doi.org/10.1007/s10514-011-9241-4openalex-extracted
Search and pursuit-evasion in mobile robotics
inferredcites →https://doi.org/10.1016/0012-365x(83)90160-7openalex-extracted
Vertex-to-vertex pursuit in a graph
inferredcites →https://doi.org/10.1016/0095-8956(85)90093-0openalex-extracted
A short note about pursuit games played on a graph with a given genus
inferredcites →https://doi.org/10.1016/0095-8956(86)90026-2openalex-extracted
On a pursuit game played on graphs for which a minor is excluded
inferredcites →https://doi.org/10.1016/0166-218x(84)90012-xopenalex-extracted
Note on a pursuit game played on graphs
inferredcites →https://doi.org/10.1016/j.jctb.2021.06.008openalex-extracted
On the cop number of toroidal graphs
inferredcites →https://doi.org/10.1080/15427951.2007.10129149openalex-extracted
Pursuit-Evasion in Models of Complex Networks
inferredcites →https://doi.org/10.1090/stml/061openalex-extracted
The Game of Cops and Robbers on Graphs
inferredcites →https://doi.org/10.1137/20m1312150openalex-extracted
Bounding the Cop Number of a Graph by Its Genus
inferredcites →https://doi.org/10.1145/3301281openalex-extracted
A Survey on Graph Drawing Beyond Planarity
inferredcites →https://doi.org/10.37236/2713openalex-extracted
The Graph Crossing Number and its Variants: A Survey
inferredcites →https://doi.org/10.4230/lipics.esa.2024.24openalex-extracted
A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs
inferredcites →https://doi.org/10.4230/lipics.icalp.2023.23openalex-extracted
On Computing Vertex Connectivity of 1-Plane Graphs
inferredcites →https://doi.org/10.4310/joc.2012.v3.n2.a6openalex-extracted
Meyniel’s conjecture on the cop number: A survey
inferredcites →https://doi.org/10.4310/joc.2020.v11.n1.a3openalex-extracted
Topological directions in Cops and Robbers
inferredcites →https://doi.org/10.4310/joc.2022.v13.n1.a4openalex-extracted
Optimizing the trade-off between number of cops and capture time in Cops and Robbers
inferredcites →https://doi.org/10.7551/mitpress/7830.003.0033openalex-extracted
Motion Strategies for Surveillance
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.