A note on maximum fractional matchings of graphs
type: Item
instance of: scholarly article
title: A note on maximum fractional matchings of graphs
zbMATH Open document ID: 1482.05274
author: Tianlong Ma
author: Eddie Cheng
author: Yaping Mao
author: Xu Wang
published in: Journal of Combinatorial Optimization
publication date: 2022-02-14T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C72
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7473272
zbMATH Keywords: matching
zbMATH Keywords: Gallai-Edmonds decomposition
zbMATH Keywords: maximum fractional matching
zbMATH Keywords: fractional matching number
zbMATH Keywords: Cartesian product
zbMATH Keywords: strong product
zbMATH Keywords: lexicographic product
zbMATH Keywords: direct product
MaRDI profile type: Publication
full work available at URL: s10878-021-00766-6
OpenAlex ID: W3167357745
cites work: Q5422499
cites work: Q3005852
cites work: The fractional matching numbers of graphs
cites work: Fractional Gallai-Edmonds decomposition and maximal graphs on fractional matching number
cites work: Matching theory
cites work: Q4382863
cites work: The Factorization of Linear Graphs
cites work: Matching preclusion number in product graphs
DOI: 10.1007/S10878-021-00766-6
description: scientific article; zbMATH DE number 7473272