Covering a graph with cycles of length at least 4 (Q1753038)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Covering a graph with cycles of length at least 4
scientific article

    Statements

    Covering a graph with cycles of length at least 4 (English)
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references