On 4-isomorphisms of graphs (Q792349)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On 4-isomorphisms of graphs |
scientific article; zbMATH DE number 3853145
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On 4-isomorphisms of graphs |
scientific article; zbMATH DE number 3853145 |
Statements
On 4-isomorphisms of graphs (English)
0 references
1984
0 references
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.
0 references
graph isomorphism
0 references
preserving homeomorphs of \(K_ 4\)
0 references
0.7816093564033508
0 references
0.7374550700187683
0 references
0.7299015522003174
0 references
