Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors (Q2147605)

From MaRDI portal
Revision as of 21:18, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors
scientific article

    Statements

    Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 June 2022
    0 references
    all \((a
    0 references
    b)\)-factors
    0 references
    \((a
    0 references
    b)\)-parity factor
    0 references
    independence number
    0 references
    connectivity
    0 references

    Identifiers