On two equimatchable graph classes

DOI10.1016/S0012-365X(02)00813-0zbMath1022.05065MaRDI QIDQ1810651

Ken-ichi Kawarabayashi, Akira Saito, Michael D. Plummer

Publication date: 9 June 2003

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

zbMATH Keywords

connected planar graphs

Mathematics Subject Classification ID

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

Related Items (7)

Equimatchable Graphs on Surfaces ⋮ Equimatchable claw-free graphs ⋮ Equimatchable Regular Graphs ⋮ On two extensions of equimatchable graphs ⋮ Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) ⋮ Bounding the size of equimatchable graphs of fixed genus ⋮ Efficient recognition of equimatchable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• Matching-perfect and cover-perfect graphs
• Randomly matchable graphs
• Equimatchable factor‐critical graphs

This page was built for publication: On two equimatchable graph classes