𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonian isomorphism of graphs

✍ Scribed by M. A. Zaitsev

Publisher
SP MAIK Nauka/Interperiodica
Year
1979
Tongue
English
Weight
319 KB
Volume
25
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the cycle-isomorphism of graphs
On the cycle-isomorphism of graphs
✍ Xingxing Yu πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 336 KB

## Abstract This paper considers conditions ensuring that cycle‐isomorphic graphs are isomorphic. Graphs of connectivity β©Ύ 2 that have no loops were studied in [2] and [4]. Here we characterize all graphs __G__ of connectivity 1 such that every graph that is cycle‐isomorphic to __G__ is also isomor

Isomorphism classes of cycle permutation
Isomorphism classes of cycle permutation graphs
✍ Jin Ho Kwak; Jaeun Lee πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 769 KB

In this paper, we construct a cycle permutation graph as a covering graph over the dumbbell graph, and give a new characterization of when two given cycle permutation graphs are isomorphic by a positive or a negative natural isomorphism. Also, we count the isomorphism classes of cycle permutation gr

On testing isomorphism of permutation gr
On testing isomorphism of permutation graphs
✍ Charles J. Colbourn πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 530 KB

## Abstract A polynomial time algorithm for testing isomorphism of permutation graphs (comparability graphs of 2‐dimensional partial orders) is described. It operates by performing two types of simplifying transformations on the graph; the contraction of duplicate vertices and the contraction of un