Contraction distance between isomorphism classes of graphs

Bohdan Zelinka

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Contraction distance between isomorphism classes of graphs”

Comparison of various distances between isomorphism classes of graphs

Bohdan Zelinka (1985)

Časopis pro pěstování matematiky

Similarity:

On the chromatic uniqueness of edge-gluing of complete tripartite graphs and cycles.

Chia, Gek Ling, Ho, Chee-Kit (2003)

Bulletin of the Malaysian Mathematical Sciences Society. Second Series

Similarity:

Edge shift distance between trees

Bohdan Zelinka (1992)

Archivum Mathematicum

Similarity:

Edge shift distance between isomorphism classes of graphs, introduced by M. Johnson, is investigated in the case of trees and compared with other distances.

Equivalences between isomorphism classes on infinite graphs

Bohdan Zelinka (1992)

Mathematica Bohemica

Similarity:

The paper studies some equivalence relations between isomorphism classes of countable graphs which correspond in a certain sense to various distances between isomorphism classes of finite graphs.