On circuits in graphs (Q799690): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: David P. Brown / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: David P. Brown / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 01:15, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On circuits in graphs |
scientific article |
Statements
On circuits in graphs (English)
0 references
1984
0 references
The author establishes the following: Let G be a simple graph on \(n_ 1+n_ 2\) vertices. If the minimum degree of G is \(([n_ 1/2]+[n_ 2/2]\) then G contains two independent circuits of lengths \(n_ 1\) and \(n_ 2\).
0 references
minimum degree
0 references
independent circuits
0 references
