A Note on $\mathtt{V}$-free 2-matchings
Keyword(s):
Motivated by a conjecture of Liang, we introduce a restricted path packing problem in bipartite graphs that we call a $\mathtt{V}$-free $2$-matching. We verify the conjecture through a weakening of the hypergraph matching problem. We close the paper by showing that it is NP-complete to decide whether one of the color classes of a bipartite graph can be covered by a $\mathtt{V}$-free $2$-matching.
2014 ◽
Vol Vol. 16 no. 3
◽
Keyword(s):
2017 ◽
Vol 09
(04)
◽
pp. 1750056
◽
Keyword(s):
2020 ◽
Keyword(s):
2020 ◽
Keyword(s):
2020 ◽
Vol 54
(3 (253))
◽
pp. 137-145
Keyword(s):
2014 ◽
Vol 6
(2)
◽
pp. 206-209
◽
Keyword(s):
1993 ◽
Vol 2
(2)
◽
pp. 103-113
◽