On the public citation graph
The isomorphism problem for classes of graphs closed under contraction
0 signed · 66 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230110103openalex-snapshot
On testing isomorphism of permutation graphs
inferredcites →https://doi.org/10.1007/3-540-12689-9_114openalex-snapshot
Isomorphism testing and canonical forms for k-contractable graphs (A generalization of bounded valence and bounded genus)
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_13openalex-snapshot
Isomorphism of Planar Graphs (Working Paper)
inferredcites →https://doi.org/10.1007/bfb0089374openalex-snapshot
On Construction and Identification of Graphs
inferredcites →https://doi.org/10.1109/sfcs.1980.34openalex-snapshot
Polynomial-time algorithms for permutation groups
inferredcites →https://doi.org/10.1112/plms/s3-20.1.144openalex-snapshot
On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0603025openalex-snapshot
Isomorphism Testing in Hookup Classes
inferredcites →https://doi.org/10.1145/322123.322125openalex-snapshot
A Linear Time Algorithm for Deciding Interval Graph Isomorphism
inferredcites →https://doi.org/10.1145/800141.804671openalex-snapshot
A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus
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.20293openalex-snapshot
Neighborhood hypergraphs of bipartite graphs
inferred← citeshttps://doi.org/10.1006/jagm.1996.0058openalex-snapshot
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs
inferred← citeshttps://doi.org/10.1007/11780342_26openalex-snapshot
On Graph Isomorphism for Restricted Graph Classes
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_64openalex-snapshot
Directed path graph isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_9openalex-snapshot
Graph Isomorphism Restricted by Lists
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_3openalex-snapshot
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-319-13524-3_12openalex-snapshot
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
inferred← citeshttps://doi.org/10.1007/978-3-540-79709-8_23openalex-snapshot
From Invariants to Canonization in Parallel
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_9openalex-snapshot
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_7openalex-snapshot
Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_11openalex-snapshot
Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes
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-015-0045-3openalex-snapshot
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
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-020-00747-xopenalex-snapshot
Graph Isomorphism for $$(H_1,H_2)$$-Free Graphs: An Almost Complete Dichotomy
inferred← citeshttps://doi.org/10.1007/s00453-026-01374-8openalex-snapshot
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1007/s10878-018-0266-xopenalex-snapshot
The QAP-polytope and the graph isomorphism problem
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100918openalex-snapshot
Parameterized complexity of graph isomorphism testing
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.029openalex-snapshot
Induced minors and well-quasi-ordering
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2023.04.034openalex-snapshot
Two-closure of rank 3 groups in polynomial time
inferred← citeshttps://doi.org/10.1016/j.laa.2015.09.023openalex-snapshot
On the isomorphism of graphs having some eigenvalues of moderate multiplicity
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.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.8005107openalex-snapshot
The Weisfeiler-Leman dimension of planar graphs is at most 3
inferred← citeshttps://doi.org/10.1137/1.9781611977073.59openalex-snapshot
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
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/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/3132720openalex-snapshot
Canonizing Graphs of Bounded Tree Width in Logspace
inferred← citeshttps://doi.org/10.1145/3333003openalex-snapshot
The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
inferred← citeshttps://doi.org/10.1145/3382082openalex-snapshot
An Improved Isomorphism Test for Bounded-tree-width Graphs
inferred← citeshttps://doi.org/10.1145/3519935.3520076openalex-snapshot
Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor
inferred← citeshttps://doi.org/10.1145/3527667openalex-snapshot
Hypergraph Isomorphism for Groups with Restricted Composition Factors
inferred← citeshttps://doi.org/10.1145/3543686openalex-snapshot
Planar Graph Isomorphism Is in Log-Space
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.1145/3686798openalex-snapshot
Automorphisms and Isomorphisms of Maps in Linear Time
inferred← citeshttps://doi.org/10.15488/3569openalex-snapshot
Computational complexity aspects of implicit graph representations
inferred← citeshttps://doi.org/10.18154/rwth-2016-06688openalex-snapshot
Canonizing Graphs of Bounded Tree Width in Logspace
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2009.2314openalex-snapshot
Graph Isomorphism for K_{3,3}-free and K_5-free graphs is in Log-space
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.103openalex-snapshot
Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth
inferred← citeshttps://doi.org/10.48456/tr-903openalex-snapshot
Parameterized complexity of distances to sparse graph classes
inferred← citeshttps://doi.org/10.48550/arxiv.1404.0818openalex-snapshot
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth
inferred← citeshttps://doi.org/10.48550/arxiv.1406.4718openalex-snapshot
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
inferred← citeshttps://doi.org/10.48550/arxiv.1605.08540openalex-snapshot
Induced Minor Free Graphs: Isomorphism and Clique-width
inferred← citeshttps://doi.org/10.48550/arxiv.1804.11089openalex-snapshot
Fundamentals of Parameterized Complexity Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1809.09939openalex-snapshot
Perfect weak modular product graphs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0608074openalex-snapshot
From Invariants to Canonization in Parallel
inferred← citeshttps://doi.org/10.5555/3329995.3330042openalex-snapshot
The weisfeiler-leman dimension of planar graphs is at most 3
inferred← citeshttps://doi.org/10.70675/658f0687ze25fz44e7z9761z187dd29af957openalex-snapshot
Structural and algorithmic aspects of partial orderings of 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.