A clique-covering sufficient condition for hamiltonicity of graphs (Q990948)
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: A clique-covering sufficient condition for hamiltonicity of graphs |
scientific article; zbMATH DE number 5777507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A clique-covering sufficient condition for hamiltonicity of graphs |
scientific article; zbMATH DE number 5777507 |
Statements
A clique-covering sufficient condition for hamiltonicity of graphs (English)
0 references
1 September 2010
0 references
design of algorithms
0 references
graph theory
0 references
Hamiltonian problem
0 references
Hamiltonian graph
0 references
clique decomposition condition
0 references
hamiltonicity
0 references
0.7986648678779602
0 references
0.7875338792800903
0 references
0.7868337631225586
0 references
