Bérczi, Kristóf and Bernáth, Attila and Vizer, Máté (2016) A note on V-free 2-matchings. ELECTRONIC JOURNAL OF COMBINATORICS, 23 (4). P4.27. ISSN 1097-1440
|
Text
1505.03717.pdf Download (495kB) | Preview |
Abstract
Motivated by a conjecture of Liang, we introduce a restricted path packing problem in bipartite graphs that we call a 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 V-free 2-matching
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Hypergraph matching; Antimagic labelling |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 02 Jan 2017 15:19 |
| Last Modified: | 02 Jan 2017 15:19 |
| URI: | http://real.mtak.hu/id/eprint/44127 |
Actions (login required)
 |
Edit Item |
