A characterization of PM-compact bipartite and near-bipartite graphs

DOI10.1016/j.disc.2012.12.015zbMath1260.05123OpenAlexW2040035534WikidataQ115287342 ScholiaQ115287342MaRDI QIDQ1942671

Yanpei Liu, Xiumei Wang, G. Sanjith, Marcelo H. De Carvalho, Cláudio Leonardo Lucchesi, Charles H. C. Little

Publication date: 19 March 2013

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.12.015

zbMATH Keywords

perfect-matching graphperfect-matching polytope

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Birkhoff--von Neumann Graphs that are PM-Compact ⋮ A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration ⋮ A characterization of cycle-forced bipartite graphs ⋮ PM-compact graphs and vertex-deleted subgraphs

This page was built for publication: A characterization of PM-compact bipartite and near-bipartite graphs