Equimatchable factor‐critical graphs
From MaRDI portal
Publication:4722091
DOI10.1002/jgt.3190100403zbMath0614.05028OpenAlexW2149745356MaRDI QIDQ4722091
Publication date: 1986
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190100403
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (12)
Totally equimatchable graphs ⋮ Equimatchable Graphs on Surfaces ⋮ Equimatchable claw-free graphs ⋮ Edge-stable equimatchable graphs ⋮ Triangle‐free equimatchable graphs ⋮ Graphs with each edge in at most one maximum matching ⋮ Equimatchable Regular Graphs ⋮ Unnamed Item ⋮ On two extensions of equimatchable graphs ⋮ Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) ⋮ On two equimatchable graph classes ⋮ Efficient recognition of equimatchable graphs
This page was built for publication: Equimatchable factor‐critical graphs
