Covering the complete graph with plane cycles (Q686275): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q126838864, #quickstatements; #temporary_batch_1721934265115 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(93)90239-k / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052760659 / rank | |||
Normal rank | |||
Latest revision as of 10:51, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering the complete graph with plane cycles |
scientific article |
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
