The isomorphism problem for classes of graphs closed under contraction
From MaRDI portal
Publication:1175965
DOI10.1007/BF01098279zbMath0745.05035MaRDI QIDQ1175965
Publication date: 25 June 1992
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
Related Items (14)
Isomorphism Testing for Graphs Excluding Small Minors ⋮ Graph isomorphism parameterized by elimination distance to bounded degree ⋮ Graph isomorphism for graph classes characterized by two forbidden induced subgraphs ⋮ Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy ⋮ Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract) ⋮ From Invariants to Canonization in Parallel ⋮ On the isomorphism of graphs having some eigenvalues of moderate multiplicity ⋮ A Faster Isomorphism Test for Graphs of Small Degree ⋮ Two-closure of rank \(3\) groups in polynomial time ⋮ Isomorphism Testing Parameterized by Genus and Beyond ⋮ Induced minor free graphs: isomorphism and clique-width ⋮ Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth ⋮ Induced minors and well-quasi-ordering ⋮ Graph isomorphism restricted by lists
Cites Work
- On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
- Homomorphiesätze für Graphen
- On testing isomorphism of permutation graphs
- Isomorphism Testing in Hookup Classes
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The isomorphism problem for classes of graphs closed under contraction
