On 4-isomorphisms of graphs

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We show that an edge-bijection between 4-connected graphs preserving homeomorphs of K4 in both directions is induced by an isomorphism. © 1984.

Cite

CITATION STYLE

APA

Lassmann, G. (1984). On 4-isomorphisms of graphs. Discrete Mathematics, 49(1), 79–81. https://doi.org/10.1016/0012-365X(84)90153-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free