A note on \(\mathtt{V}\)-free \(2\)-matchings

A note on \(\mathtt{V}\)-free \(2\)-matchings

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 weakenin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2015-05
Hauptverfasser: Bérczi, Kristóf, Bernáth, Attila, Máté Vizer
Format: Artikel
Sprache:eng
Schlagworte:
Graph matching
Graph theory
Graphs
Matching
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2331-8422