zbMATH — the first resource for mathematics

Isomorphism testing in hookup classes. (English) Zbl 0503.05023

05C05 Trees
05C99 Graph theory
Full Text: DOI
[1] Problems polynomially equivalent to graph isomorphismT.R.C.S. 77-04Dept. of Computer Science, Univ. of WaterlooCanada1979
[2] Recent results on the graph isomorphism problemProceedings of the Eighth Manitoba Conference on Numerical Mathematics and Computing (Univ. Manitoba, Winnipeg, Man., 1978)Congress. Numer., XXIIUtilitas Math.Winnipeg, Man.19791331
[3] Ph.D. ThesisExtensions and generalizations of graph theorems to complexes and hypergraphsUniv. of WaterlooOntario, Canada1974
[4] Farley, A., Networks immune to isolated failures, Networks, 11, 255, (1981) · Zbl 0459.94036
[5] A polynomial-time algorithm for determining the isomorphism of graphs of fixed genusProc. 12th Annual ACM Symposium on Theory of Computing1980236243
[6] Fulkerson, D. R.; Gross, O. A., Incidence matrices and interval graphs, Pacific J. Math., 15, 835, (1965) · Zbl 0132.21001
[7] Characterizations and constructions of minimally 2-connected graphs and minimally strong digraphsProceedings of the Second Louisiana Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La., 1971)Louisiana State Univ.Baton Rouge, La.1971257282
[8] 1977Private communications · Zbl 0418.35076
[9] Hopcroft, J. E.; Tarjan, R. E.; Miller, R. E.; Thatcher, J. W., Isomorphism of planar graphs, Complexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N. Y., 1972), (1972), Plenum, New York · Zbl 0436.05021
[10] Linear time algorithm for isomorphism of planar graphs: preliminary reportSixth Annual ACM Symposium on Theory of Computing (Seattle, Wash., 1974)Assoc. Comput. Mach., New York1974172184
[11] Isomorphism of graphs of bounded valence can be tested in polynomial timeProc. 21st Annual IEEE Symposium on Foundations of Computer Science19804249
[12] Isomorphism testing for graphs of bounded genusProc. 12th Annual ACM Symposium on Theory of Computing1980226235
[13] Ph.D. ThesisAlgorithms on trees and maximal outer-planar graphs: design complexity, analysis and data-structures studiesUniv. of VirginiaCharlottesville1976
[14] Centres of k-treesCS-TR-79-9Dept. of Computing and Information Sciences, Univ. of OregonEugene1979
[15] Separating subgraphs in cables and caterpillarsCS-TR-79-18Dept. of Comp. and Inf. Sci., Univ. of OregonEugene1979
[16] Read, RonaldC.; Corneil, DerekG., The graph isomorphism disease, J. Graph Theory, 1, 339, (1977) · Zbl 0381.05026
[17] Rose, DonaldJ., On simple characterizations of k-trees, Discrete Math., 7, 317, (1974) · Zbl 0285.05128
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.