A note on maximum fractional matchings of graphs

DOI10.1007/s10878-021-00766-6zbMath1482.05274OpenAlexW3167357745MaRDI QIDQ2075471

Eddie Cheng, Yaping Mao, Xu Wang, Tianlong Ma

Publication date: 14 February 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00766-6

zbMATH Keywords

matchingCartesian productstrong productdirect productfractional matching numberlexicographic productGallai-Edmonds decompositionmaximum fractional matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76) Fractional graph theory, fuzzy graph theory (05C72)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• Matching preclusion number in product graphs
• Fractional Gallai-Edmonds decomposition and maximal graphs on fractional matching number
• The fractional matching numbers of graphs
• The Factorization of Linear Graphs

This page was built for publication: A note on maximum fractional matchings of graphs