On circuits in graphs (Q799690)
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: On circuits in graphs |
scientific article; zbMATH DE number 3873366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On circuits in graphs |
scientific article; zbMATH DE number 3873366 |
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
0.806480884552002
0 references
0.8015478849411011
0 references
0.7966122031211853
0 references
