scientific article; zbMATH DE number 3878378

MaRDI QIDQ3343455zbMATH OpenFDO

Authors Ilya Ponomarenko

Publication date 1984

Full work available at URL https://eudml.org/doc/67618

zbMATH Keywords

graph isomorphismgraphs of bounded valencepolynomial-time algorithmtime complexityundirected graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus
• scientific article; zbMATH DE number 2123426
• Isomorphism of graphs which are pairwise k-separable
• The isomorphism problem for classes of graphs closed under contraction
• Isomorphism of planar graphs (working paper)

Cited in

(3)

• Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus
• scientific article; zbMATH DE number 3999309 (Why is no real title available?)
• scientific article; zbMATH DE number 2123426 (Why is no real title available?)

This page was built for publication:

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