Positive matching decompositions of graphs

A matching \(M\) in a graph \(\Gamma\) is positive if \(\Gamma\) has a vertex-labeling such that \(M\) coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of \(\Gamma\) is an edge-partition \(M_1,\ldots,M_p\) of \(\Gamma\) such that \(M_i\) is a positive ma...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2022-09
Hauptverfasser:	Mohammad Farrokhi Derakhshandeh Ghouchan, Gharakhloo, Shekoofeh, Ali Akbar Yazdan Pour
Format:	Artikel
Sprache:	eng
Schlagworte:	Cacti Decomposition Graph matching Graph theory Graphical representations Graphs
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!