Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) (Q738850)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) |
scientific article; zbMATH DE number 6617192
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) |
scientific article; zbMATH DE number 6617192 |
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
