Covering the complete graph with plane cycles (Q686275)
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: Covering the complete graph with plane cycles |
scientific article; zbMATH DE number 428120
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering the complete graph with plane cycles |
scientific article; zbMATH DE number 428120 |
Statements
Covering the complete graph with plane cycles (English)
0 references
28 August 1994
0 references
Let \(n\) vertices be distributed on the circumference of a circle in the plane. The authors determine, for each \(n\), the minimum number of cycles with no crossing edges such that every pair of vertices is adjacent on at least one cycle.
0 references
covering
0 references
complete graph
0 references
plane cycles
0 references
0 references
0.92532235
0 references
0.92465484
0 references
0.9199737
0 references
0 references
