The graph of perfect matching polytope and an extreme problem

DOI10.1016/j.disc.2009.03.009zbMath1213.05203OpenAlexW2156113850MaRDI QIDQ1044975

Hong Bian, Fu Ji Zhang

Publication date: 15 December 2009

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

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

zbMATH Keywords

polytopesaturated graphperfect matching graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

A characterization of PM-compact Hamiltonian bipartite graphs

Cites Work

• Hamiltonicity in (0-1)-polyhedra
• Bounds on the forcing numbers of bipartite graphs
• Matching theory
• Hamiltonicity and combinatorial polyhedra
• The minimum forcing number for the torus and hypercube
• On certain polytopes associated with graphs
• Plane elementary bipartite graphs
• Hexagonal systems with forcing edges
• Global forcing number of benzenoid graphs

This page was built for publication: The graph of perfect matching polytope and an extreme problem