A necessary condition for the equality of the clique number and the convexity number of a graph (Q2127622)
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 7510700
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A necessary condition for the equality of the clique number and the convexity number of a graph |
scientific article; zbMATH DE number 7510700 |
Statements
A necessary condition for the equality of the clique number and the convexity number of a graph (English)
0 references
20 April 2022
0 references
geodesic convexity
0 references
convexity number
0 references
clique number
0 references
monophonic convexity
0 references
distance-hereditary graphs
0 references
chordal graphs
0 references
0 references
0 references
0 references
0.8442344069480896
0 references
0.7934189438819885
0 references
0.7934189438819885
0 references
