Edge-dominating cycles, \(k\)-walks and Hamilton prisms in \(2K_2\)-free graphs (Q2835378)
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: Edge-dominating cycles, k-walks and Hamilton prisms in 2K₂-free graphs |
scientific article; zbMATH DE number 6659071
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-dominating cycles, \(k\)-walks and Hamilton prisms in \(2K_2\)-free graphs |
scientific article; zbMATH DE number 6659071 |
Statements
2 December 2016
0 references
\(2K_2\)-free graphs
0 references
\(t\)-tough graphs
0 references
\(k\)-walk
0 references
prism-Hamiltonicity
0 references
Edge-dominating cycles, \(k\)-walks and Hamilton prisms in \(2K_2\)-free graphs (English)
0 references
0.8386018872261047
0 references
0.8328501582145691
0 references
0.8235750794410706
0 references
0.8234884142875671
0 references
0.8231378197669983
0 references
