A CHARACTERIZATION OF PM-COMPACT CLAW-FREE CUBIC GRAPHS

DOI10.1142/S1793830914500256zbMath1302.05147OpenAlexW2100428650MaRDI QIDQ2875690

Yanpei Liu, Xiumei Wang, Marcelo H. De Carvalho, Wei-Ping Shang

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

zbMATH Keywords

perfect matching polytopeperfect-matching graph

Mathematics Subject Classification ID

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

Related Items (4)

Birkhoff--von Neumann Graphs that are PM-Compact ⋮ A characterization of cycle-forced bipartite graphs ⋮ PM-compact graphs and vertex-deleted subgraphs ⋮ A characterization of PM-compact Hamiltonian bipartite graphs

Cites Work

• A characterization of PM-compact Hamiltonian bipartite graphs

This page was built for publication: A CHARACTERIZATION OF PM-COMPACT CLAW-FREE CUBIC GRAPHS