PM-compact graphs and vertex-deleted subgraphs

DOI10.1007/s10255-022-1018-3zbMath1500.05053OpenAlexW4306850833MaRDI QIDQ2087670

Xiumei Wang, Yi-pei Zhang, Jinjiang Yuan

Publication date: 21 October 2022

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-022-1018-3

zbMATH Keywords

perfect matchingbicritical graphnice cyclePM-compact 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)

Related Items (1)

Graphs with each edge in at most one maximum matching

Cites Work

• Unnamed Item
• Matching theory
• On certain polytopes associated with graphs
• On tight cuts in matching covered graphs
• A characterization of PM-compact bipartite and near-bipartite graphs
• Factor-critical graphs with the minimum number of near-perfect matchings
• A CHARACTERIZATION OF PM-COMPACT CLAW-FREE CUBIC GRAPHS
• Birkhoff--von Neumann Graphs that are PM-Compact
• The Factorization of Linear Graphs

This page was built for publication: PM-compact graphs and vertex-deleted subgraphs