Graphs with each edge in at most one maximum matching

DOI10.1016/j.dam.2024.01.038OpenAlexW4391830592MaRDI QIDQ6130212

Mengyuan Niu, Xiumei Wang, Yi-pei Zhang, Jinfeng Liu

Publication date: 2 April 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2024.01.038

zbMATH Keywords

bipartite graphmaximum matchingperfect matchingfactor-critical graph

Mathematics Subject Classification ID

Graph theory (05Cxx) Designs and configurations (05Bxx) Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• On graphs with a unique perfect matching
• Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
• Matching theory
• Equimatchable claw-free graphs
• PM-compact graphs and vertex-deleted subgraphs
• A note on minimal matching covered graphs
• Randomly matchable graphs
• Equimatchable Regular Graphs
• Equimatchable factor‐critical graphs
• On Representatives of Subsets
• Triangle‐free equimatchable graphs

This page was built for publication: Graphs with each edge in at most one maximum matching