0-dual closures for several classes of graphs (Q1411106)
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: 0-dual closures for several classes of graphs |
scientific article; zbMATH DE number 1993509
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 0-dual closures for several classes of graphs |
scientific article; zbMATH DE number 1993509 |
Statements
0-dual closures for several classes of graphs (English)
0 references
16 October 2003
0 references
The authors show that for almost all sufficient conditions based on degree sums or neighborhood unions of 3-independent sets for a graph \(G\) to be Hamiltonian imply that the \(0\)-dual closure of \(G\) is complete. The proofs are very short.
0 references
0.8972375
0 references
0.8922732
0 references
0 references
0.87458575
0 references
0 references
