On the public citation graph

An Improved Planar Graph Product Structure Theorem

0 signed · 40 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.22030openalex-snapshot
Parameters Tied to Treewidth
inferredcites →https://doi.org/10.1007/0-387-22444-0_4openalex-snapshot
Algorithmic Aspects of Tree Width
inferredcites →https://doi.org/10.1007/s00454-016-9777-3openalex-snapshot
Apollonian Ball Packings and Stacked Polytopes
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/j.dam.2005.05.021openalex-snapshot
Subclasses of k-trees: Characterization and recognition
inferredcites →https://doi.org/10.1016/j.jctb.2021.06.002openalex-snapshot
Polynomial bounds for centered colorings on proper minor-closed graph classes
inferredcites →https://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferredcites →https://doi.org/10.1017/s0963548321000213openalex-snapshot
Clustered 3-colouring graphs of bounded degree
inferredcites →https://doi.org/10.1080/15427951.2013.796300openalex-snapshot
Some Properties of Random Apollonian Networks
inferredcites →https://doi.org/10.1109/focs.2019.00056openalex-snapshot
Planar Graphs have Bounded Queue-Number
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/0607033openalex-snapshot
Characterization and Recognition of Partial 3-Trees
inferredcites →https://doi.org/10.1137/1.9781611975994.27openalex-snapshot
Shorter Labeling Schemes for Planar Graphs
inferredcites →https://doi.org/10.1145/3385731openalex-snapshot
Planar Graphs Have Bounded Queue-Number
inferredcites →https://doi.org/10.19086/aic.12100openalex-snapshot
Planar graphs have bounded nonrepetitive chromatic number
inferredcites →https://doi.org/10.19086/aic.27351openalex-snapshot
Improved Bounds for Centered Colorings
inferredcites →https://doi.org/10.46298/dmtcs.7458openalex-snapshot
Separating layered treewidth and row treewidth
inferredcites →https://doi.org/10.48550/arxiv.1210.8113openalex-snapshot
A note on planar partial 3-trees
inferredcites →https://doi.org/10.48550/arxiv.2007.06455openalex-snapshot
Asymptotically Optimal Vertex Ranking of Planar Graphs
inferredcites →https://doi.org/10.48550/arxiv.2202.11858openalex-snapshot
Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
inferredcites →https://doi.org/10.5555/3310435.3310526openalex-snapshot
Polynomial bounds for centered colorings on proper minor-closed graph classes

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-38906-1_29openalex-snapshot
Linear Layouts of Bipartite Planar Graphs
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-031-87469-7_15openalex-snapshot
Product Structure
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/focs57990.2023.00116openalex-snapshot
Proof of the Clustered Hadwiger Conjecture
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00069openalex-snapshot
Transductions of Graph Classes Admitting Product Structure
inferred← citeshttps://doi.org/10.1112/jlms.12781openalex-snapshot
Sparse universal graphs for planarity
inferred← citeshttps://doi.org/10.1137/22m1540296openalex-snapshot
Shallow Minors, Graph Products, and Beyond-Planar Graphs
inferred← citeshttps://doi.org/10.1137/23m1591773openalex-snapshot
Product Structure Extension of the Alon–Seymour–Thomas Theorem
inferred← citeshttps://doi.org/10.37236/11712openalex-snapshot
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure
inferred← citeshttps://doi.org/10.48550/arxiv.2109.00327openalex-snapshot
Universality in minor-closed graph classes
inferred← citeshttps://doi.org/10.5802/igt.10openalex-snapshot
Product Structure of Graph Classes with Strongly Sublinear Separators
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.