Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus

DOI10.1016/S0019-9958(83)80047-3zbMath0542.05056MaRDI QIDQ3329513

Gary Lee Miller

Publication date: 1983

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

graphs of bounded valencepolynomial time isomorphism testcontractible graphsgraphs of bounded genus

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99) Algorithms in computer science (68W99)

Related Items (9)

Isomorphism Testing for Graphs Excluding Small Minors ⋮ An additivity theorem for the genus of a graph ⋮ Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery ⋮ Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ From Invariants to Canonization in Parallel ⋮ The Space Complexity of k-Tree Isomorphism ⋮ Colored hypergraph isomorphism is fixed parameter tractable ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs

This page was built for publication: Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus