A characterization of nonfeasible sets in matching covered graphs

DOI10.1002/jgt.22570zbMath1525.05156MaRDI QIDQ6134642

Qing Cui, Xing Feng, Fuliang Lu, Qinghai Liu

Publication date: 22 August 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

perfect matchingfeasible setmatching covered graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Matching theory
• Matching structure and the matching lattice
• Optimal ear decompositions of matching covered graphs and bases for the matching lattice
• On essentially 4-edge-connected cubic bricks
• How to build a brick
• Graphs with independent perfect matchings
• Spanning bipartite quadrangulations of even triangulations
• On perfect matchings in matching covered graphs
• On nonfeasible edge sets in matching‐covered graphs
• Perfect Matchings of Regular Bipartite Graphs

This page was built for publication: A characterization of nonfeasible sets in matching covered graphs