Eternal connected vertex cover problem in graphs: complexity and algorithms (Q6908088)
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 8113894
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Eternal connected vertex cover problem in graphs: complexity and algorithms |
scientific article; zbMATH DE number 8113894 |
Statements
Eternal connected vertex cover problem in graphs: complexity and algorithms (English)
0 references
1 November 2025
0 references
eternal connected vertex cover
0 references
bipartite graphs
0 references
Hamiltonian graphs
0 references
Mycielskian
0 references
cographs
0 references
distance-hereditary graphs
0 references
graph algorithms
0 references
0 references
0 references
