A note on \({\mathtt V}\)-free 2-matchings (Q727204)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6661379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on \({\mathtt V}\)-free 2-matchings |
scientific article; zbMATH DE number 6661379 |
Statements
A note on \({\mathtt V}\)-free 2-matchings (English)
0 references
6 December 2016
0 references
Summary: Motivated by a conjecture of \textit{Y.-C. Liang} [Anti-magic labeling of graphs. National Sun Yat-sen University (PhD Thesis) (2013)], 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.
0 references
antimagic labelling
0 references
hypergraph matching
0 references
0.7747673988342285
0 references
0.769562304019928
0 references
0.760478675365448
0 references
0.7544074654579163
0 references
