On the public citation graph

Graph isomorphism and theorems of Birkhoff type

0 signed · 67 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.3190010410openalex-snapshot
The graph isomorphism disease
inferredcites →https://doi.org/10.1002/jgt.3190030202openalex-snapshot
Further annotated bibliography on the isomorphism disease
inferredcites →https://doi.org/10.1007/bf00533407openalex-snapshot
Results and problems in the theory of doubly-stochastic matrices
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1016/0095-8956(77)90010-7openalex-snapshot
Convex polyhedra of doubly stochastic matrices: II. Graph of
inferredcites →https://doi.org/10.1016/0097-3165(77)90051-6openalex-snapshot
Convex polyhedra of doubly stochastic matrices. I. Applications of the permanent function
inferredcites →https://doi.org/10.1137/1016083openalex-snapshot
On the Assignment Polytope
inferredcites →https://doi.org/10.1145/321556.321562openalex-snapshot
An Efficient Algorithm for Graph Isomorphism

What points at this work

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

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/3-540-59071-4_64openalex-snapshot
Directed path graph isomorphism
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_5openalex-snapshot
Convex Hulls of Algebraic Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_26openalex-snapshot
Color Refinement, Homomorphisms, and Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_5openalex-snapshot
On Volumes of Permutation Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-319-22177-9_26openalex-snapshot
On the Power of Color Refinement
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_13openalex-snapshot
Limitations of Algebraic Approaches to Graph Isomorphism Testing
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_3openalex-snapshot
On Tinhofer’s Linear Programming Approach to Isomorphism Testing
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_3openalex-snapshot
Symmetry and eigenvectors
inferred← citeshttps://doi.org/10.1007/bf02238229openalex-snapshot
Isomorphism of chordal (6, 3) graphs
inferred← citeshttps://doi.org/10.1007/s00037-016-0147-6openalex-snapshot
Graph Isomorphism, Color Refinement, and Compactness
inferred← citeshttps://doi.org/10.1007/s00224-020-09990-9openalex-snapshot
On the Expressive Power of Linear Algebra on Graphs
inferred← citeshttps://doi.org/10.1007/s00493-021-4336-9openalex-snapshot
Fractional Isomorphism of Graphons
inferred← citeshttps://doi.org/10.1007/s10114-004-0485-1openalex-snapshot
On Compact Graphs
inferred← citeshttps://doi.org/10.1007/s10623-016-0313-5openalex-snapshot
Consolidation for compact constraints and Kendall tau LP decodable permutation codes
inferred← citeshttps://doi.org/10.1007/s13226-023-00439-6openalex-snapshot
Pattern polynomial graphs
inferred← citeshttps://doi.org/10.1007/s41109-019-0219-zopenalex-snapshot
A family of tractable graph metrics
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90241-0openalex-snapshot
Fractional isomorphism of graphs
inferred← citeshttps://doi.org/10.1016/0024-3795(88)90054-7openalex-snapshot
A note on certain subpolytopes of the assignment polytope associated with circulant graphs
inferred← citeshttps://doi.org/10.1016/0024-3795(88)90239-xopenalex-snapshot
Some applications of doubly stochastic matrices
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90100-xopenalex-snapshot
Strong tree-cographs are birkhoff graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90049-3openalex-snapshot
A note on compact graphs
inferred← citeshttps://doi.org/10.1016/j.aim.2009.05.003openalex-snapshot
On permutation polytopes
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.01.004openalex-snapshot
Sherali–Adams relaxations of graph isomorphism polytopes
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103751openalex-snapshot
Approximating fractionally isomorphic graphons
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104803openalex-snapshot
On the Weisfeiler-Leman dimension of fractional packing
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.11.002openalex-snapshot
Quantum and non-signalling graph isomorphisms
inferred← citeshttps://doi.org/10.1016/j.jctb.2026.07.003openalex-snapshot
Oddomorphisms and homomorphism indistinguishability over graphs of bounded degree
inferred← citeshttps://doi.org/10.1016/j.jksuci.2023.01.006openalex-snapshot
A natural language interface for automatic generation of data flow diagram using web extraction techniques
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00152-7openalex-snapshot
Forestal algebras and algebraic forests (on a new class of weakly compact graphs)
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00238-6openalex-snapshot
Compact cellular algebras and permutation groups
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)83595-1openalex-snapshot
Compact graphs and equitable partitions
inferred← citeshttps://doi.org/10.1017/cbo9780511529993.008openalex-snapshot
Automorphisms of graphs
inferred← citeshttps://doi.org/10.1017/jsl.2015.28openalex-snapshot
PEBBLE GAMES AND LINEAR EQUATIONS
inferred← citeshttps://doi.org/10.1017/s096354832510028xopenalex-snapshot
Canonization of a random circulant graph by counting walks
inferred← citeshttps://doi.org/10.1023/a:1006133917784openalex-snapshot
Affine Isomorphism for Partially Ordered Sets
inferred← citeshttps://doi.org/10.1109/isit.2012.6284109openalex-snapshot
On ML-certificate linear constraints for rank modulation with linear programming decoding and its application to compact graphs
inferred← citeshttps://doi.org/10.1109/jxcdc.2023.3235113openalex-snapshot
Dynamical System-Based Computational Models for Solving Combinatorial Optimization on Hypergraphs
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470543openalex-snapshot
On the Expressive Power of Homomorphism Counts
inferred← citeshttps://doi.org/10.1137/1.9781611974782.21openalex-snapshot
Linear Diophantine Equations, Group CSPs, and Graph Isomorphism
inferred← citeshttps://doi.org/10.1137/20m1338435openalex-snapshot
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem
inferred← citeshttps://doi.org/10.1145/3209108.3209186openalex-snapshot
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem
inferred← citeshttps://doi.org/10.1145/3651587openalex-snapshot
The Weisfeiler-Leman Dimension of Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/3677121openalex-snapshot
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations
inferred← citeshttps://doi.org/10.1145/3717823.3718173openalex-snapshot
Smoothed Analysis for Graph Isomorphism
inferred← citeshttps://doi.org/10.1145/3756323openalex-snapshot
The Sherali–Adams and Weisfeiler–Leman Hierarchies in (Promise Valued) Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.18154/rwth-2021-07044openalex-snapshot
Graph Similarity and Homomorphism Densities
inferred← citeshttps://doi.org/10.26493/1855-3974.289.91dopenalex-snapshot
Polytopes associated to dihedral groups
inferred← citeshttps://doi.org/10.37236/10973openalex-snapshot
Weisfeiler-Leman Indistinguishability of Graphons
inferred← citeshttps://doi.org/10.37236/1224openalex-snapshot
Problems in Algebraic Combinatorics
inferred← citeshttps://doi.org/10.37236/386openalex-snapshot
Recognizing Graph Theoretic Properties with Polynomial Ideals
inferred← citeshttps://doi.org/10.37236/4499openalex-snapshot
Faces of Birkhoff Polytopes
inferred← citeshttps://doi.org/10.3934/dcdsb.2018190openalex-snapshot
Dynamical systems associated with adjacency matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1002.1921openalex-snapshot
Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. II. Program Implementation of the Weisfeiler-Leman Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.2008.08499openalex-snapshot
Fractional hypergraph isomorphism and fractional invariants
inferred← citeshttps://doi.org/10.48550/arxiv.2112.09001openalex-snapshot
Weisfeiler-Leman Indistinguishability of Graphons
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-080openalex-snapshot
Fractionally Isomorphic Graphs and Graphons
inferred← citeshttps://doi.org/10.70675/95fb364azf8b2z4edczb25dz3fc6ef2d836dopenalex-snapshot
Modélisation, approche polyédrale et approche arborescente pour des problèmes de comparaison de graphes
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.