EUDML | A characterization of the decay number of a connected graph

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

Displaying similar documents to “A characterization of the decay number of a connected graph”

On 2-cell embeddings of graphs with minimum numbers of regions

Ladislav Nebeský (1985)

Czechoslovak Mathematical Journal

Similarity:

A new characterization of the maximum genus of a graph

Ladislav Nebeský (1981)

Czechoslovak Mathematical Journal

Similarity:

On locally quasiconnected graphs and their upper embeddability

Ladislav Nebeský (1985)

Czechoslovak Mathematical Journal

Similarity: