EUDML | Edge-distance between isomorphism classes of graphs

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

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

The coarseness of a graph

Lowell W. Beineke, Gary Chartrand (1968)

Compositio Mathematica

Similarity:

The distance between a graph and its complement

Bohdan Zelinka (1987)

Czechoslovak Mathematical Journal

Similarity:

Small directed graphs as neighbourhood graphs

Bohdan Zelinka (1988)

Czechoslovak Mathematical Journal

Similarity: