A characterization of PM-compact Hamiltonian bipartite graphs
From MaRDI portal
Publication:2355348
DOI10.1007/s10255-015-0475-3zbMath1317.05157OpenAlexW1515128446MaRDI QIDQ2355348
Jinjiang Yuan, Yanpei Liu, Xiumei Wang
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)
Related Items
Birkhoff--von Neumann Graphs that are PM-Compact ⋮ A characterization of cycle-forced bipartite graphs ⋮ A CHARACTERIZATION OF PM-COMPACT CLAW-FREE CUBIC GRAPHS
Cites Work
- Unnamed Item
- Hamiltonicity in (0-1)-polyhedra
- The graph of perfect matching polytope and an extreme problem
- Matching theory
- On certain polytopes associated with graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A CHARACTERIZATION OF PM-COMPACT CLAW-FREE CUBIC GRAPHS
- The travelling salesman problem and a class of polyhedra of diameter two