Covering a graph with cycles of length at least 4 (Q1753038)
From MaRDI portal
!
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 6873111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering a graph with cycles of length at least 4 |
scientific article; zbMATH DE number 6873111 |
Statements
Covering a graph with cycles of length at least 4 (English)
0 references
25 May 2018
0 references
Summary: Let \(G\) be a graph of order \(n\geq 4k\), where \(k\) is a positive integer. Suppose that the minimum degree of \(G\) is at least \(\lceil n/2\rceil\). We show that \(G\) contains \(k\) vertex-disjoint cycles covering all the vertices of \(G\) such that \(k-1\) of them are quadrilaterals.
0 references
cycles
0 references
disjoint cycles
0 references
cycle coverings
0 references
0.8916983604431152
0 references
0.8901466131210327
0 references
0.8659738302230835
0 references
0.8603938817977905
0 references
0.8545612096786499
0 references
