Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs (Q2706129)
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: Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs |
scientific article; zbMATH DE number 1578767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs |
scientific article; zbMATH DE number 1578767 |
Statements
19 March 2001
0 references
claw-free graphs
0 references
(claw, net)-free graphs
0 references
Hamiltonian path
0 references
Hamiltonian cycle
0 references
dominating pair
0 references
dominating path
0 references
linear time algorithms
0 references
Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs (English)
0 references
0.9980478286743164
0 references
0.8533015251159668
0 references
0.8501172065734863
0 references
0.8378333449363708
0 references
