Factor criticality and complete closure of graphs (Q1874349)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1915531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Factor criticality and complete closure of graphs |
scientific article; zbMATH DE number 1915531 |
Statements
Factor criticality and complete closure of graphs (English)
0 references
25 May 2003
0 references
\(n\)-factor-critical graphs
0 references
local completion
0 references
closure
0 references
perfect matching
0 references
independence number
0 references
domination number
0 references
0.8654689788818359
0 references
0.864142894744873
0 references
0.8454595804214478
0 references
0.7961333394050598
0 references
