2-Isomorphic Graphs
From MaRDI portal
Cited in
(63)- On two unsolved problems concerning matching covered graphs
- Rooted K₄-minors
- Linkless embeddings of graphs in 3-space
- Polynomial Invariants of Graphs
- Classification of external zonotopal algebras
- Large induced forests in graphs
- A positivity phenomenon in Elser's Gaussian-cluster percolation model
- ON MUTATION AND KHOVANOV HOMOLOGY
- Torelli theorem for graphs and tropical curves
- Transversals and colorings of simplicial spheres
- Matroids Determine the Embeddability of Graphs in Surfaces
- A non-abelian analogue of Whitney's 2-isomorphism theorem
- Tension continuous maps -- their structure and applications
- The arborescence-realization problem
- Non-separating cocircuits avoiding some elements
- Problems on pairs of trees and the four colour problem of planar graphs (extended abstract)
- The complexity of the matroid homomorphism problem
- Re-embedding structures of 4-connected projective-planar graphs
- Preserving and increasing symmetries of polyhedral maps
- Graph theory (algorithmic, algebraic, and metric problems)
- Modular Constructions for Combinatorial Geometries
- Tropical curves of hyperelliptic type
- Small separations in pinch-graphic matroids
- On Four Problems in Graph Theory
- A note on amphicheiral alternating links
- \(K_4\)-free and \(\overline{C_6}\)-free planar matching covered graphs
- Representations of bicircular lift matroids
- Asymptotics of classical spin networks. With an appendix by Don Zagier
- Lower bounds for electrical reduction on surfaces
- Generic unlabeled global rigidity
- Graph reconstruction from unlabeled edge lengths
- Testing mutual duality of planar graphs
- On Invariants of Graphs with Applications to Knot Theory
- Nonseparating Cocircuits in Binary Matroids
- On the 2-sum in rigidity matroids
- On the Complexity of Matroid Isomorphism Problems
- Ordering circuits of matroids
- Torelli theorem for stable curves
- The dynamics of the forest graph operator
- Nahm sums, stability and the colored Jones polynomial
- Counting 5-connected planar triangulations
- Flexibility of projective-planar embeddings
- Uniform random sampling of planar graphs in linear time
- Face-width of embedded graphs
- Matroids -- the engineers' revenge
- Partially broken orientations of Eulerian plane graphs
- There exist non‐isomorphic STS(19) with equivalent point codes
- Recognizing Even-Cycle and Even-Cut Matroids
- The magnitude of a graph
- Boundary rigidity of 3D CAT(0) cube complexes
- Feynman graph polynomials
- Deciding the Erdős-Pósa Property in 3-Connected Digraphs
- Kernelization of Whitney switches
- Displaying blocking pairs in signed graphs
- Flag algebras and the stable coefficients of the Jones polynomial
- Single Commodity Representation of Multicommodity Networks
- Strong Tutte Functions of Matroids and Graphs
- Recognizing even-cycle and even-cut matroids
- Cellular automorphisms and self-duality
- ON TANGLES AND MATROIDS
- Graph isomorphism problem
- Strip planarity testing for embedded planar graphs
- \(k\)-circular matroids of graphs
This page was built for publication: 2-Isomorphic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4752593)
