On matching cover of graphs

DOI10.1007/s10107-013-0731-3zbMath1297.90145OpenAlexW2024512399MaRDI QIDQ463743

Jinjiang Yuan, Xiaoxin Song, Xiumei Wang

Publication date: 17 October 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-013-0731-3

zbMATH Keywords

matchingedge covermatching covermatching cover number

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (4)

Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks ⋮ How many matchings cover the nodes of a graph? ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) ⋮ A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration

Cites Work

• Unnamed Item
• TWO THEOREMS IN GRAPH THEORY
• Improved Bounds for Matroid Partition and Intersection Algorithms
• Paths, Trees, and Flowers

This page was built for publication: On matching cover of graphs