Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\) (Q6581900)
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 7890787
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\) |
scientific article; zbMATH DE number 7890787 |
Statements
Graphs \(G\) where \(G-N[v]\) is a tree for each vertex \(v\) (English)
0 references
1 August 2024
0 references
star
0 references
path
0 references
tree
0 references
clique
0 references
Trahtenbrot-Zykov problem
0 references
0 references
0 references
0.8634316921234131
0 references
0.8050732612609863
0 references
0.7261860370635986
0 references
