Neighbourhood tournaments
Bohdan Zelinka (1986)
Mathematica Slovaca
Similarity:
Bohdan Zelinka (1986)
Mathematica Slovaca
Similarity:
Bohdan Zelinka (1975)
Czechoslovak Mathematical Journal
Similarity:
Ronald Dutton, William F. Klostermeyer (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering, edge domination, and matching parameters is explored. In addition, the total vertex cover number is compared to the total domination number of trees and grid 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.
Bohdan Zelinka (1973)
Časopis pro pěstování matematiky
Similarity: