Graphs with maximal induced matchings of the same size (Q344824)
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: Graphs with maximal induced matchings of the same size |
scientific article; zbMATH DE number 6656003
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs with maximal induced matchings of the same size |
scientific article; zbMATH DE number 6656003 |
Statements
Graphs with maximal induced matchings of the same size (English)
0 references
24 November 2016
0 references
induced matching
0 references
well-covered graph
0 references
optimization problem
0 references
computational complexity
0 references
forbidden induced subgraph
0 references
0 references
0.8900802731513977
0 references
0.8629521131515503
0 references
0.8162968158721924
0 references
0.8162968158721924
0 references
