Concerning the complexity of deciding isomorphism of block designs

DOI10.1016/0166-218X(81)90012-3zbMATH Open0475.05075MaRDI QIDQ1159699FDOQ1159699

Authors: Marlene J. Colbourn, Charles J. Colbourn 

Publication date: 1981

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

self-complementary graphsisomorphism testing

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Graph theory (05C99)

Cites Work

• Graph theory
• Random Graph Isomorphism
• The graph isomorphism disease
• Balanced incomplete block designs and related designs
• On the Complexity of Canonical Labeling of Strongly Regular Graphs
• Constructions of Disjoint Steiner Triple Systems
• On the n^{log n} isomorphism technique (A Preliminary Report)
• On the maximum number of disjoint Steiner triple systems
• Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A theorem on the maximum number of disjoint Steiner triple systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Problem 94

Cited In (6)

• The complexity of computing the automorphism group of automata and related problems
• Title not available (Why is that?)
• Coined quantum walks lift the cospectrality of graphs and trees
• Computational complexity of reconstruction and isomorphism testing for designs and line graphs
• A parallelization of Miller's \(n^{\log n}\) isomorphism technique
• Latin directed triple systems

This page was built for publication: Concerning the complexity of deciding isomorphism of block designs

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