On matching cover of graphs

DOI10.1007/S10107-013-0731-3MaRDI QIDQ463743zbMATH OpenOpenAlexFDO

Authors Xiumei Wang, Xiaoxin Song, Jinjiang Yuan

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

edge covermatchingmatching covermatching cover number

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 975376
• scientific article; zbMATH DE number 5952201
• Matching covered graphs
• A note on minimal matching covered graphs
• A generalisation of matching and colouring

Cites work

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

Cited in

(12)

• A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration
• A generalisation of matching and colouring
• Equivalence classes in matching covered graphs
• Equitable partitions into matchings and coverings in mixed graphs
• A note on minimal matching covered graphs
• Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
• Maintaining a large matching and a small vertex cover
• scientific article; zbMATH DE number 5308553 (Why is no real title available?)
• scientific article; zbMATH DE number 975376 (Why is no real title available?)
• Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
• How many matchings cover the nodes of a graph?
• Fairness in graph-theoretical optimization problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463743)