2-Isomorphic Graphs

From MaRDI portal
Revision as of 22:27, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4752593

DOI10.2307/2371127zbMath0006.37005OpenAlexW4234391028WikidataQ56017725 ScholiaQ56017725MaRDI QIDQ4752593

No author found.

Publication date: 1933

Published in: American Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2371127




Related Items (60)

Single Commodity Representation of Multicommodity NetworksRecognizing Even-Cycle and Even-Cut MatroidsUnnamed ItemOn Two Unsolved Problems Concerning Matching Covered GraphsThe arborescence-realization problemRepresentations of bicircular lift matroidsOn Invariants of Graphs with Applications to Knot TheoryThe dynamics of the forest graph operatorFlexibility of projective-planar embeddingsPartially broken orientations of Eulerian plane graphsCellular automorphisms and self-dualityRooted \(K_4\)-minorsRecognizing even-cycle and even-cut matroidsAsymptotics of classical spin networks. With an appendix by Don ZagierSmall separations in pinch-graphic matroidsTransversals and colorings of simplicial spheresThe complexity of the matroid homomorphism problemTension continuous maps -- their structure and applicationsTorelli theorem for stable curvesMatroids—the Engineers’ RevengeA positivity phenomenon in Elser's Gaussian-cluster percolation modelA non-abelian analogue of Whitney's 2-isomorphism theoremProblems on pairs of trees and the four colour problem of planar graphsClassification of external zonotopal algebrasDisplaying blocking pairs in signed graphsFlag algebras and the stable coefficients of the Jones polynomialON TANGLES AND MATROIDSA NOTE ON AMPHICHEIRAL ALTERNATING LINKSCounting 5-connected planar triangulationsThere exist non‐isomorphic STS(19) with equivalent point codesStrip planarity testing for embedded planar graphs\(k\)-circular matroids of graphsFEYNMAN GRAPH POLYNOMIALSTorelli theorem for graphs and tropical curvesOn the 2-sum in rigidity matroidsUniform random sampling of planar graphs in linear timeGraph theory (algorithmic, algebraic, and metric problems)ON MUTATION AND KHOVANOV HOMOLOGYStrong Tutte Functions of Matroids and GraphsLinkless embeddings of graphs in 3-spaceTropical curves of hyperelliptic typeGraph reconstruction from unlabeled edge lengthsK 4 -free and C6¯-free Planar Matching Covered GraphsModular Constructions for Combinatorial GeometriesLower bounds for electrical reduction on surfacesOn the Complexity of Matroid Isomorphism ProblemsLarge Induced Forests in GraphsGENERIC UNLABELED GLOBAL RIGIDITYRe-embedding structures of 4-connected projective-planar graphsOn Four Problems in Graph TheoryKernelization of Whitney SwitchesThe magnitude of a graphGraph isomorphism problemMatroids Determine the Embeddability of Graphs in SurfacesNon-separating cocircuits avoiding some elementsTESTING MUTUAL DUALITY OF PLANAR GRAPHSPolynomial Invariants of GraphsNahm sums, stability and the colored Jones polynomialNonseparating Cocircuits in Binary MatroidsOrdering circuits of matroids







This page was built for publication: 2-Isomorphic Graphs