A characterization of PM-compact Hamiltonian bipartite graphs

DOI10.1007/S10255-015-0475-3MaRDI QIDQ2355348zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(7)

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

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)