Two classes of graphs in which some problems related to convexity are efficiently solvable (Q4554573)
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: Two classes of graphs in which some problems related to convexity are efficiently solvable |
scientific article; zbMATH DE number 6979593
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two classes of graphs in which some problems related to convexity are efficiently solvable |
scientific article; zbMATH DE number 6979593 |
Statements
Two classes of graphs in which some problems related to convexity are efficiently solvable (English)
0 references
14 November 2018
0 references
geodesic convexity
0 references
monophonic convexity
0 references
2-geodesic convexity
0 references
cross-cyclic
0 references
distance-hereditary graphs
0 references
0 references
0 references
0.8057961463928223
0 references
0.8024262189865112
0 references
0.8019012212753296
0 references
0.7782124876976013
0 references
0.7759078145027161
0 references
