Isomorphism of graphs which are pairwise k-separable
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 176203
- \( K_{1 , 2}\)-isolation in graphs
- Graph isomorphism and theorems of Birkhoff type
- Isomorphisms of \(P_{k}\)-graphs for \(k \geqslant 4\)
- Isomorphic factorisation of graphs
- scientific article; zbMATH DE number 3847439
- scientific article; zbMATH DE number 3896988
- On isomorphic subgraphs
- scientific article; zbMATH DE number 3815
- On graphs isomorphic to their neighbour and non-neighbour sets
Cited in
(12)- Testing isomorphism of circulant objects in polynomial time
- Graphs of separability at most two: structural characterizations and their consequences
- Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus
- scientific article; zbMATH DE number 3878378 (Why is no real title available?)
- Graphs of separability at most 2
- Graph theory (algorithmic, algebraic, and metric problems)
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs
- Isomorphism Testing Parameterized by Genus and Beyond
- Testing isomorphism of circulant objects in polynomial time
- Hypergraph isomorphism for groups with restricted composition factors
- Isomorphism for tournaments of small twin width
- Isomorphism testing of k-spanning tournaments is fixed parameter tractable
This page was built for publication: Isomorphism of graphs which are pairwise k-separable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337512)
