Vertex covering with monochromatic paths.
Erdős, Paul, Gyárfás, András (1995)
Mathematica Pannonica
Similarity:
Erdős, Paul, Gyárfás, András (1995)
Mathematica Pannonica
Similarity:
Alon, Noga, Ruszinkó, Miklós (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
W. S. Chou, Y. Manoussakis, O. Megalakaki, M. Spyratos, Zs. Tuza (1994)
Mathématiques et Sciences Humaines
Similarity:
We study the problem of finding an alternating path having given endpoints and passing through a given set of vertices in edge-colored graphs (a path is alternating if any two consecutive edges are in different colors). In particular, we show that this problem in NP-complete for 2-edge-colored graphs. Then we give a polynomial characterization when we restrict ourselves to 2-edge-colored complete graphs. We also investigate on (s,t)-paths through fixed vertices, i.e. paths of length...
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.
Fulmek, Markus (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dzido, Tomasz, Kubale, Marek, Piwakowski, Konrad (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Frohmader, Andrew (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gyárfás, András (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity: