A characterization of PM-compact claw-free cubic graphs

DOI10.1142/S1793830914500256zbMATH Open1302.05147OpenAlexW2100428650MaRDI QIDQ2875690FDOQ2875690

Authors: Xiumei Wang, Marcelo H. de Carvalho, Weiping Shang, Yixun Lin 

Publication date: 11 August 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830914500256

Recommendations

• A characterization of PM-compact bipartite and near-bipartite graphs
• PM-compact graphs and vertex-deleted subgraphs
• Perfect matchings in claw-free cubic graphs
• A characterization of PM-compact Hamiltonian bipartite graphs
• The graph of perfect matching polytope and an extreme problem

zbMATH Keywords

perfect matching polytopeperfect-matching graph

Mathematics Subject Classification ID

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

Cites Work

• A characterization of PM-compact Hamiltonian bipartite graphs

Cited In (8)

• Skeleton matching polytope: realization and isomorphism
• Characterization of perfect matching transitive graphs
• A characterization of cycle-forced bipartite graphs
• Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs
• Birkhoff-von Neumann graphs that are PM-compact
• A characterization of PM-compact Hamiltonian bipartite graphs
• A note on PM-compact bipartite graphs
• PM-compact graphs and vertex-deleted subgraphs

This page was built for publication: A characterization of PM-compact claw-free cubic graphs

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