Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) (Q738850): Difference between revisions
From MaRDI portal
Latest revision as of 10:15, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) |
scientific article |
Statements
Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) (English)
0 references
16 August 2016
0 references
equimatchable graph
0 references
forbidden subgraph
0 references
Gallai-Edmonds decomposition
0 references
factor-critical
0 references
