The degree-diameter problem for claw-free graphs and hypergraphs (Q2874093)
From MaRDI portal
!
WARNING
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 6251274
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The degree-diameter problem for claw-free graphs and hypergraphs |
scientific article; zbMATH DE number 6251274 |
Statements
28 January 2014
0 references
claw-free graph
0 references
hypergraph
0 references
degree
0 references
diameter
0 references
Moore geometry
0 references
0 references
0 references
0.9023928
0 references
0.9014865
0 references
0.9011989
0 references
0.90119874
0 references
0.8986308
0 references
0.8978672
0 references
The degree-diameter problem for claw-free graphs and hypergraphs (English)
0 references
