scientific article; zbMATH DE number 89183

MaRDI QIDQ4016724zbMATH OpenFDO

Authors Bohdan Zelinka

Publication date 16 January 1993

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

zbMATH Keywords

distancesedge rotationequivalence relationinfinite graphisomorphism classtree

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph theory (05C99)

Recommendations

• Computable isomorphisms for certain classes of infinite graphs
• scientific article; zbMATH DE number 3889567
• Distinguishing homomorphisms of infinite graphs
• scientific article; zbMATH DE number 3815
• scientific article; zbMATH DE number 7006355
• On a property of graphs containing infinitely many isomorphic copies of themselves
• scientific article; zbMATH DE number 6019705
• Logical Approaches to Computational Barriers
• Isomorphism of two infinite-chromatic triangle-free graphs
• On the D-equivalence class of graph

Cited in

(7)

• Mutation classes of diagrams via infinite graphs
• Isomorphisms and algorithmic properties of structures with two equivalences
• Edge-distance between isomorphism classes of graphs
• scientific article; zbMATH DE number 125503 (Why is no real title available?)
• The isodominism class of the graphs
• On graphs and M-equivalence
• Different similarities

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 Q4016724)