Corrigendum to ``Completeness results for graph isomorphism

DOI10.1016/J.JCSS.2005.11.002zbMATH Open1103.68656OpenAlexW2087899083MaRDI QIDQ2495413FDOQ2495413

Authors: Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán 

Publication date: 30 June 2006

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2005.11.002

Recommendations

• Corrigendum to: V. V. Vasilchikov, “Parallel Algorithm for Solving the Graph Isomorphism Problem”, Modeling and analysis of information systems, vol. 27, no. 1, pp. 86–94, 2020. DOI: https://doi.org/10.18255/1818-1015-2020-1-86-94
• Corrigendum to "On Isometric Embeddings of Graphs"
• Corrigendum to ``Counting connected graphs inside-out [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)]
• Completeness results for graph isomorphism.
• Graph isomorphism is in the low hierarchy

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (4)

• Title not available (Why is that?)
• Corrigendum to: `Complexity of diagrams'
• a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution
• Corrigendum to “Regressive isols and comparability”

This page was built for publication: Corrigendum to ``Completeness results for graph isomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495413)