Name
Abstract | ||
|---|---|---|
Motivated by a conjecture of Liang [Y.-C. Liang. {\em Anti-magic labeling of graphs}. PhD thesis, National Sun Yat-sen University, 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. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Discrete mathematics,Graph,Combinatorics,Packing problems,Bipartite graph,Hypergraph,New digraph reconstruction conjecture,Conjecture,Mathematics |
DocType | Volume | Citations |
Journal | abs/1505.03717 | 0 |
PageRank | References | Authors |
0.34 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kristóf Bérczi | 1 | 28 | 12.40 |
| Attila Bernáth | 2 | 20 | 7.99 |
| Máté Vizer | 3 | 27 | 14.06 |