On the public citation graph

Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs

0 signed · 106 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.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1006/jctb.1996.0059openalex-snapshot
Graph Minors
inferredcites →https://doi.org/10.1006/jctb.1999.1898openalex-snapshot
Énumération des cartes pointées sur une surface orientable de genre quelconque en fonction des nombres de sommets et de faces
inferredcites →https://doi.org/10.1007/0-387-22444-0_4openalex-snapshot
Algorithmic Aspects of Tree Width
inferredcites →https://doi.org/10.1007/bf01364272openalex-snapshot
Homomorphieeigenschaften und mittlere Kantendichte von Graphen
inferredcites →https://doi.org/10.1007/s00373-006-0684-xopenalex-snapshot
Some Recent Progress and Applications in Graph Minor Theory
inferredcites →https://doi.org/10.1007/s00493-003-0037-9openalex-snapshot
Local Tree-Width, Excluded Minors, and Approximation Algorithms
inferredcites →https://doi.org/10.1016/0022-0000(82)90009-5openalex-snapshot
Isomorphism of graphs of bounded valence can be tested in polynomial time
inferredcites →https://doi.org/10.1016/0095-8956(91)90061-nopenalex-snapshot
Graph minors. X. Obstructions to tree-decomposition
inferredcites →https://doi.org/10.1016/0196-6774(90)90013-5openalex-snapshot
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
inferredcites →https://doi.org/10.1016/j.jcss.2010.12.002openalex-snapshot
Implicit branching and parameterized partial cover problems
inferredcites →https://doi.org/10.1016/j.jctb.2004.08.001openalex-snapshot
Graph Minors. XX. Wagner's conjecture
inferredcites →https://doi.org/10.1016/j.tcs.2005.10.007openalex-snapshot
Parameterized graph separation problems
inferredcites →https://doi.org/10.1016/s0019-9958(83)80047-3openalex-snapshot
Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus
inferredcites →https://doi.org/10.1017/cbo9780511662119.006openalex-snapshot
Tree Width and Tangles: A New Connectivity Measure and Some Applications
inferredcites →https://doi.org/10.1017/cbo9781107325678.009openalex-snapshot
Graph minors – a survey
inferredcites →https://doi.org/10.1109/focs.2004.27openalex-snapshot
Edge-Disjoint Paths in Planar Graphs
inferredcites →https://doi.org/10.1109/focs.2010.20openalex-snapshot
Deciding First-Order Properties for Sparse Graphs
inferredcites →https://doi.org/10.1109/focs.2014.28openalex-snapshot
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
inferredcites →https://doi.org/10.1109/lics.2008.10openalex-snapshot
Definable Tree Decompositions
inferredcites →https://doi.org/10.1109/sfcs.2005.14openalex-snapshot
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
inferredcites →https://doi.org/10.1145/1132516.1132576openalex-snapshot
Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
inferredcites →https://doi.org/10.1145/1806689.1806784openalex-snapshot
A shorter proof of the graph minor algorithm
inferredcites →https://doi.org/10.1145/1993636.1993697openalex-snapshot
A simpler algorithm and shorter proof for the graph minor decomposition
inferredcites →https://doi.org/10.1145/2371656.2371662openalex-snapshot
Fixed-point definability and polynomial time on graphs with excluded minors
inferredcites →https://doi.org/10.1145/800061.808746openalex-snapshot
Canonical labeling of graphs
inferredcites →https://doi.org/10.1145/800141.804670openalex-snapshot
Isomorphism testing for graphs of bounded genus
inferredcites →https://doi.org/10.1145/800141.804671openalex-snapshot
A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus
inferredcites →https://doi.org/10.48550/arxiv.1011.1827openalex-snapshot
Finding topological subgraphs is fixed-parameter tractable

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.5484openalex-snapshot
A polynomial‐time algorithm for simple undirected graph isomorphism
inferred← citeshttps://doi.org/10.1002/jgt.21990openalex-snapshot
A Structure Theorem for Strong Immersions
inferred← citeshttps://doi.org/10.1002/jgt.22127openalex-snapshot
Topological Minors of Cover Graphs and Dimension
inferred← citeshttps://doi.org/10.1002/jgt.23272openalex-snapshot
Dominating Kt‐Models
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_695openalex-snapshot
Finding Topological Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_22openalex-snapshot
On Weak Isomorphism of Rooted Vertex-Colored Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-80627-9_7openalex-snapshot
Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_18openalex-snapshot
Constraint Satisfaction, Graph Isomorphism, and the Pebbling Comonad
inferred← citeshttps://doi.org/10.1007/978-3-031-87469-7_11openalex-snapshot
Sources
inferred← citeshttps://doi.org/10.1007/978-3-031-87469-7_17openalex-snapshot
Isomorphism Testing
inferred← citeshttps://doi.org/10.1007/978-3-031-87469-7_9openalex-snapshot
Topological Minors
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_28openalex-snapshot
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_2openalex-snapshot
Tangles and Connectivity in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_21openalex-snapshot
Induced Minor Free Graphs: Isomorphism and Clique-width
inferred← citeshttps://doi.org/10.1007/s00453-016-0234-8openalex-snapshot
Induced Minor Free Graphs: Isomorphism and Clique-Width
inferred← citeshttps://doi.org/10.1007/s00453-019-00614-4openalex-snapshot
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
inferred← citeshttps://doi.org/10.1007/s00453-024-01289-2openalex-snapshot
Complexity Framework for Forbidden Subgraphs I: The Framework
inferred← citeshttps://doi.org/10.1007/s00493-024-00097-0openalex-snapshot
Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100855openalex-snapshot
On the generalized coloring numbers
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100918openalex-snapshot
Parameterized complexity of graph isomorphism testing
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.101035openalex-snapshot
Quo Vadis, Kernelization?
inferred← citeshttps://doi.org/10.1016/j.disc.2014.03.014openalex-snapshot
Graphs with no 7-wheel subdivision
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113668openalex-snapshot
Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.04.001openalex-snapshot
Canonical tree-decompositions of finite graphs I. Existence and algorithms
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.09.001openalex-snapshot
Minors and dimension
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.05.006openalex-snapshot
Layered separators in minor-closed graph classes with applications
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.05.001openalex-snapshot
Excluding subdivisions of bounded degree graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.01.005openalex-snapshot
A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.10.008openalex-snapshot
Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.03.002openalex-snapshot
Sparse induced subgraphs of large treewidth
inferred← citeshttps://doi.org/10.1017/9781009036214.006openalex-snapshot
Recent advances on the graph isomorphism problem
inferred← citeshttps://doi.org/10.1017/9781139028868openalex-snapshot
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
inferred← citeshttps://doi.org/10.1109/focs.2014.28openalex-snapshot
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1109/focs.2015.66openalex-snapshot
Isomorphism Testing for Graphs of Bounded Rank Width
inferred← citeshttps://doi.org/10.1109/focs.2018.00018openalex-snapshot
A Faster Isomorphism Test for Graphs of Small Degree
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00064openalex-snapshot
Isomorphism Testing for Graphs Excluding Small Minors
inferred← citeshttps://doi.org/10.1109/lics.2017.8005115openalex-snapshot
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion
inferred← citeshttps://doi.org/10.1109/lics.2019.8785682openalex-snapshot
Canonisation and Definability for Graphs of Bounded Rank Width
inferred← citeshttps://doi.org/10.1112/jlms.12633openalex-snapshot
Packing topological minors half‐integrally
inferred← citeshttps://doi.org/10.1137/1.9781611974782.100openalex-snapshot
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes
inferred← citeshttps://doi.org/10.1137/1.9781611975994.136openalex-snapshot
Improved bounds for centered colorings
inferred← citeshttps://doi.org/10.1137/1.9781611976465.120openalex-snapshot
Rankwidth meets stability
inferred← citeshttps://doi.org/10.1137/1.9781611977073.59openalex-snapshot
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
inferred← citeshttps://doi.org/10.1137/140988553openalex-snapshot
Minimum Bisection Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1137/140999980openalex-snapshot
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1137/15m1027565openalex-snapshot
Computing with Tangles
inferred← citeshttps://doi.org/10.1137/15m1032077openalex-snapshot
Designing FPT Algorithms for Cut Problems Using Randomized Contractions
inferred← citeshttps://doi.org/10.1137/15m103618xopenalex-snapshot
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
inferred← citeshttps://doi.org/10.1137/18m1198296openalex-snapshot
A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors
inferred← citeshttps://doi.org/10.1137/19m1245293openalex-snapshot
A Faster Isomorphism Test for Graphs of Small Degree
inferred← citeshttps://doi.org/10.1137/21m1401930openalex-snapshot
Isomorphism Testing for Graphs Excluding Small Minors
inferred← citeshttps://doi.org/10.1137/22m1514076openalex-snapshot
Isomorphism Testing Parameterized by Genus and Beyond
inferred← citeshttps://doi.org/10.1145/2746539.2746587openalex-snapshot
Computing with Tangles
inferred← citeshttps://doi.org/10.1145/2933575.2934508openalex-snapshot
Definability equals recognizability for graphs of bounded treewidth
inferred← citeshttps://doi.org/10.1145/3155298openalex-snapshot
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors
inferred← citeshttps://doi.org/10.1145/3274652openalex-snapshot
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes
inferred← citeshttps://doi.org/10.1145/3372123openalex-snapshot
The graph isomorphism problem
inferred← citeshttps://doi.org/10.1145/3382082openalex-snapshot
An Improved Isomorphism Test for Bounded-tree-width Graphs
inferred← citeshttps://doi.org/10.1145/3448016.3452820openalex-snapshot
Graph Iso/Auto-morphism
inferred← citeshttps://doi.org/10.1145/3453943openalex-snapshot
Isomorphism, canonization, and definability for graphs of bounded rank width
inferred← citeshttps://doi.org/10.1145/3527667openalex-snapshot
Hypergraph Isomorphism for Groups with Restricted Composition Factors
inferred← citeshttps://doi.org/10.1145/3550496openalex-snapshot
Theory research in India
inferred← citeshttps://doi.org/10.1145/3568025openalex-snapshot
Canonisation and Definability for Graphs of Bounded Rank Width
inferred← citeshttps://doi.org/10.1145/3651986openalex-snapshot
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
inferred← citeshttps://doi.org/10.19086/aic.12100openalex-snapshot
Planar graphs have bounded nonrepetitive chromatic number
inferred← citeshttps://doi.org/10.19086/aic.27351openalex-snapshot
Improved Bounds for Centered Colorings
inferred← citeshttps://doi.org/10.21953/lse.yczhu2j6vv7nopenalex-snapshot
Chromatic and structural properties of sparse graph classes
inferred← citeshttps://doi.org/10.37236/11029openalex-snapshot
Long Induced Paths in Minor-Closed Graph Classes and Beyond
inferred← citeshttps://doi.org/10.37236/9777openalex-snapshot
Nonrepetitive Graph Colouring
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.103openalex-snapshot
Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2016.85openalex-snapshot
The Generalised Colouring Numbers on Classes of Bounded Expansion
inferred← citeshttps://doi.org/10.46298/dmtcs.2076openalex-snapshot
The graph isomorphism problem on geometric graphs
inferred← citeshttps://doi.org/10.48456/tr-903openalex-snapshot
Parameterized complexity of distances to sparse graph classes
inferred← citeshttps://doi.org/10.48550/arxiv.1505.03737openalex-snapshot
Isomorphism Testing for Graphs of Bounded Rank Width
inferred← citeshttps://doi.org/10.48550/arxiv.1511.02460openalex-snapshot
Graph Isomorphism for Bounded Genus Graphs In Linear Time
inferred← citeshttps://doi.org/10.48550/arxiv.1705.01224openalex-snapshot
Topological containment of the 5-clique minus an edge in 4-connected graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1903.09011openalex-snapshot
Graphs avoiding immersion of K_{3,3}
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.