On circuits in graphs (Q799690)

From MaRDI portal
Revision as of 02:15, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On circuits in graphs
scientific article

    Statements

    title
    On circuits in graphs (English)
    0 references
    publication date
    1984
    0 references
    review text
    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
    zbMATH DE Number
    3873366
    0 references
    zbMATH Keywords
    minimum degree
    0 references
    independent circuits
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q799690&oldid=25793458"
    Powered by MediaWiki