A note on PM-compact bipartite graphs

DOI10.7151/DMGT.1706zbMATH Open1290.05121OpenAlexW1984558221MaRDI QIDQ2450134FDOQ2450134

Authors: Jin-Feng Liu, Xiumei Wang 

Publication date: 16 May 2014

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1706

Recommendations

• A characterization of PM-compact Hamiltonian bipartite graphs
• PM-compact graphs and vertex-deleted subgraphs
• A characterization of PM-compact claw-free cubic graphs
• A characterization of PM-compact bipartite and near-bipartite graphs
• Birkhoff-von Neumann graphs that are PM-compact

zbMATH Keywords

perfect matchingPM-compact graphmatching-covered graph

Mathematics Subject Classification ID

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

Cites Work

• Wiener index of trees: Theory and applications
• Extremal values for ratios of distances in trees
• Title not available (Why is that?)

Cited In (6)

• Positive matching decompositions of graphs
• 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 characterization of PM-compact Hamiltonian bipartite graphs
• PM-compact graphs and vertex-deleted subgraphs

This page was built for publication: A note on PM-compact bipartite graphs

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