Characterization of the induced matching extendable graphs with \(2 n\) vertices and \(3 n\) edges (Q1699544)
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: Characterization of the induced matching extendable graphs with 2 n vertices and 3 n edges |
scientific article; zbMATH DE number 6842961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterization of the induced matching extendable graphs with \(2 n\) vertices and \(3 n\) edges |
scientific article; zbMATH DE number 6842961 |
Statements
Characterization of the induced matching extendable graphs with \(2 n\) vertices and \(3 n\) edges (English)
0 references
23 February 2018
0 references
matching
0 references
perfect matching
0 references
induced matching
0 references
induced matching extendable
0 references
0.8871905207633972
0 references
