Integer k-matchings of graphs: k-Berge–Tutte formula, k-factor-critical graphs and k-barriers

An integer k-matching of a graph G is a function h that assigns to each edge an integer in {0,…,k} such that ∑e∈Γ(v)h(e)≤k for each vertex v, where Γ(v) is the set of edges incident with v. The integer k-matching number of G is the maximum number of ∑e∈E(G)h(e) over all integer k-matchings h of G. W...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2021-07, Vol.297, p.120-128
Hauptverfasser:	Liu, Yan, Su, Xueli, Xiong, Danni
Format:	Artikel
Sprache:	eng
Schlagworte:	[formula omitted]-barrier [formula omitted]-Berge–Tutte formula [formula omitted]-factor-critical Graph matching Graph theory Graphs Integer [formula omitted]-matching Integers k factors Mathematical problems Theorems
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!