A Contribution to my Article: 'Introducing an Orientation into a Given Non-Directed Graph'
Bohdan Zelinka (1967)
Matematický časopis
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On vertices and edges in maximum path-factors of a tree”
A Contribution to my Article: 'Introducing an Orientation into a Given Non-Directed Graph'
On Decomposition of a Tree into the Minimal Number of Paths
Anton Kotzig (1967)
Matematický časopis
Similarity:
On the cutting edge: simplified planarity by edge addition.
Boyer, John M., Myrvold, Wendy J. (2004)
Journal of Graph Algorithms and Applications
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.
Intersection graphs of trees and tree algebras
Bohdan Zelinka (1976)
Mathematica Slovaca
Similarity: