scientific article

zbMATH Open0772.05095MaRDI QIDQ4016724

Bohdan Zelinka

Publication date: 16 January 1993

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

Title of this publication is not available (Why is that?)

zbMATH Keywords

treedistancesinfinite graphisomorphism classequivalence relationedge rotation

Mathematics Subject Classification ID

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

Related Items (1)

Mutation classes of diagrams via infinite graphs

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On a property of graphs containing infinitely many isomorphic copies of themselves 👍 👎
• Isomorphism of two infinite-chromatic triangle-free graphs 👍 👎
• On the \(\mathcal D\)-equivalence class of graph 👍 👎
• Computable isomorphisms for certain classes of infinite graphs 👍 👎
• Distinguishing homomorphisms of infinite graphs 👍 👎
• Logical Approaches to Computational Barriers 👍 👎

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)