On 4-isomorphisms of graphs
From MaRDI portal
A 4-isomorphism of two graphs G, G' is a bijection \(\phi:E(G)\to E(G')\) such that both \(\phi\) and \(\phi^{-1}\) preserve homeomorphs of \(K_ 4\). It is proved that each 4-isomorphism between 4-connected graphs is induced by a (usual) graph isomorphism.
Recommendations
Cites work
Cited in
(7)- On the determination problem for \(P_{4}\)-transformation of graphs
- Isomorphisms of \(P_{k}\)-graphs for \(k \geqslant 4\)
- Isomorphism of regular NM-graphs of degree 4
- scientific article; zbMATH DE number 5901711 (Why is no real title available?)
- scientific article; zbMATH DE number 5711645 (Why is no real title available?)
- scientific article; zbMATH DE number 1051283 (Why is no real title available?)
- On Terwilliger graphs with = 4
This page was built for publication: On 4-isomorphisms of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792349)