A Contribution to my Article: 'Introducing an Orientation into a Given Non-Directed Graph'
Bohdan Zelinka (1967)
Matematický časopis
Similarity:
Bohdan Zelinka (1967)
Matematický časopis
Similarity:
Anton Kotzig (1967)
Matematický časopis
Similarity:
Boyer, John M., Myrvold, Wendy J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
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.
Bohdan Zelinka (1976)
Mathematica Slovaca
Similarity: