On the public citation graph

Improved product structure for graphs on surfaces

0 signed · 30 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.1007/s00453-005-1184-8openalex-snapshot
Recognizing Hole-Free 4-Map Graphs in Cubic Time
inferredcites →https://doi.org/10.1007/s00453-018-0510-xopenalex-snapshot
Characterizing and Recognizing 4-Map Graphs
inferredcites →https://doi.org/10.1016/j.cosrev.2017.06.002openalex-snapshot
An annotated bibliography on 1-planarity
inferredcites →https://doi.org/10.1016/j.jctb.2017.05.006openalex-snapshot
Layered separators in minor-closed graph classes with applications
inferredcites →https://doi.org/10.1016/j.jctb.2023.03.004openalex-snapshot
Graph product structure for non-minor-closed classes
inferredcites →https://doi.org/10.1017/s0963548321000213openalex-snapshot
Clustered 3-colouring graphs of bounded degree
inferredcites →https://doi.org/10.1109/focs46700.2020.00060openalex-snapshot
Adjacency Labelling for Planar Graphs (and Beyond)
inferredcites →https://doi.org/10.1112/jlms.12781openalex-snapshot
Sparse universal graphs for planarity
inferredcites →https://doi.org/10.1137/1.9781611975994openalex-snapshot
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
inferredcites →https://doi.org/10.1137/16m1062879openalex-snapshot
Structure of Graphs with Locally Restricted Crossings
inferredcites →https://doi.org/10.1145/3477542openalex-snapshot
Adjacency Labelling for Planar Graphs (and Beyond)
inferredcites →https://doi.org/10.19086/aic.27351openalex-snapshot
Improved Bounds for Centered Colorings
inferredcites →https://doi.org/10.4230/lipicsopenalex-snapshot
Wadge Degrees of $\omega$-Languages of Petri Nets
inferredcites →https://doi.org/10.4230/lipics.isaac.2022.23openalex-snapshot
Graph Product Structure for h-Framed Graphs
inferredcites →https://doi.org/10.4230/lipics.socg.2020openalex-snapshot
LIPIcs, Volume 164, SoCG 2020, Complete Volume
inferredcites →https://doi.org/10.48550/arxiv.2202.11858openalex-snapshot
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.23008openalex-snapshot
The product structure of squaregraphs
inferred← citeshttps://doi.org/10.1002/jgt.23023openalex-snapshot
Structural properties of graph products
inferred← citeshttps://doi.org/10.1007/978-3-031-47417-0_9openalex-snapshot
Product Structure of Graph Classes with Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-032-10503-5_1openalex-snapshot
Graph Product Structure Theory with Applications
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103847openalex-snapshot
Colouring strong products
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.03.004openalex-snapshot
Graph product structure for non-minor-closed classes
inferred← citeshttps://doi.org/10.1017/s0963548323000457openalex-snapshot
Product structure of graph classes with bounded treewidth
inferred← citeshttps://doi.org/10.1090/btran/192openalex-snapshot
Product structure of graphs with an excluded minor
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00069openalex-snapshot
Transductions of Graph Classes Admitting Product Structure
inferred← citeshttps://doi.org/10.22215/etd/2023-15707openalex-snapshot
Graph Colouring and Decomposition
inferred← citeshttps://doi.org/10.37236/11712openalex-snapshot
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure
inferred← citeshttps://doi.org/10.5802/igt.10openalex-snapshot
Product Structure of Graph Classes with Strongly Sublinear Separators
inferred← citeshttps://doi.org/10.5802/igt.4openalex-snapshot
Powers of planar graphs, product structure, and blocking partitions
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-049openalex-snapshot
Powers of planar graphs, product structure, and blocking partitions
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.