On Whitney's 2‐isomorphism theorem for graphs
From MaRDI portal
Publication:4180393
DOI10.1002/jgt.3190040106zbMath0397.05043OpenAlexW2118628437MaRDI QIDQ4180393
Publication date: 1980
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190040106
Related Items
A decomposition theory for matroids. II. Minimal violation matroids, A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs, On edge semi-isomorphisms and semi-dualities of graphs, A decomposition theory for matroids. V: Testing of matrix total unimodularity, A 2-isomorphism theorem for hypergraphs, Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs, From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals, A Torelli theorem for graph isomorphisms, Hepp's bound for Feynman graphs and matroids, On the complexity of matroid isomorphism problem, Lattices, graphs, and Conway mutation, Dualizing distance-hereditary graphs, Duality of infinite graphs, FEYNMAN GRAPH POLYNOMIALS, A 2-isomorphism theorem for delta-matroids, Lower bounds for electrical reduction on surfaces, On the Complexity of Matroid Isomorphism Problems, Ensembles libres de chemins dans un graphe, On the efficiency of representability tests for matroids, Kernelization of Whitney Switches, Kernelization of Whitney Switches, On theories of Whitney and Tutte
