Isomorphism of graphs which are pairwise k-separable

DOI10.1016/S0019-9958(83)80048-5zbMath0546.05057MaRDI QIDQ3337512

Gary Lee Miller

Publication date: 1983

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

zbMATH Keywords

bounded valence testtesting isomorphism of graphs

Mathematics Subject Classification ID

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

Related Items (6)

Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ Graphs of separability at most 2 ⋮ Isomorphism Testing Parameterized by Genus and Beyond ⋮ Graphs of Separability at Most Two: Structural Characterizations and Their Consequences ⋮ Testing isomorphism of circulant objects in polynomial time ⋮ Graph theory (algorithmic, algebraic, and metric problems)

This page was built for publication: Isomorphism of graphs which are pairwise k-separable