The Complexity of Combinatorial Isomorphism Problems

DOI10.1016/S0167-5060(08)70859-8MaRDI QIDQ3900077zbMATH OpenOpenAlexFDO

Authors Marlene J. Colbourn, Charles J. Colbourn

Publication date 1980

Published in Combinatorics 79 Part I (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-5060(08)70859-8

zbMATH Keywords

combinatorial designsblock designsisomorphism problemsisomorphism complete problemsregular self-complementary graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Enumeration in graph theory (05C30)

Cited in

(1)

• Graph isomorphism problem

This page was built for publication: The Complexity of Combinatorial Isomorphism Problems

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