A characterization of PM-compact Hamiltonian bipartite graphs

DOI10.1007/S10255-015-0475-3zbMATH Open1317.05157OpenAlexW1515128446MaRDI QIDQ2355348FDOQ2355348

Authors: Xiumei Wang, Jinjiang Yuan, Yanpei Liu 

Publication date: 22 July 2015

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

Full work available at URL: https://doi.org/10.1007/s10255-015-0475-3

Recommendations

• A characterization of PM-compact bipartite and near-bipartite graphs
• A note on PM-compact bipartite graphs
• PM-compact graphs and vertex-deleted subgraphs
• Birkhoff-von Neumann graphs that are PM-compact
• The graph of perfect matching polytope and an extreme problem

zbMATH Keywords

bipartite graphHamiltonian graphperfect matching polytopeperfect-matching graphH2C-bipartite graphs

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Matching theory
• On certain polytopes associated with graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Hamiltonicity in (0-1)-polyhedra
• The graph of perfect matching polytope and an extreme problem
• The travelling salesman problem and a class of polyhedra of diameter two
• A characterization of PM-compact claw-free cubic graphs

Cited In (5)

• The graph of perfect matching polytope and an extreme problem
• Birkhoff--von Neumann Graphs that are PM-Compact
• A characterization of cycle-forced bipartite graphs
• A characterization of PM-compact bipartite and near-bipartite graphs
• A characterization of PM-compact claw-free cubic graphs

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

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