EUDML | A Contribution to my Article: 'Introducing an Orientation into a Given Non-Directed Graph'

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

Displaying similar documents to “A Contribution to my Article: 'Introducing an Orientation into a Given Non-Directed Graph'”

On vertices and edges in maximum path-factors of a tree

Zdzisław Skupień, Władysław Zygmunt (1980)

Fundamenta Mathematicae

Similarity:

Geodetic graphs of diameter two

Bohdan Zelinka (1975)

Czechoslovak Mathematical Journal

Similarity:

Analoga of Menger's theorem for polar and polarized graphs

Bohdan Zelinka (1976)

Czechoslovak Mathematical Journal

Similarity:

On the Vertex Separation of Maximal Outerplanar Graphs

Markov, Minko (2008)

Serdica Journal of Computing

Similarity:

We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability, of submops.