A toughness condition for fractional \((k,m)\)-deleted graphs (Q2377232)

From MaRDI portal
Revision as of 19:19, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A toughness condition for fractional \((k,m)\)-deleted graphs
scientific article

    Statements

    A toughness condition for fractional \((k,m)\)-deleted graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 June 2013
    0 references
    combinatorial problems
    0 references
    graph
    0 references
    toughness
    0 references
    fractional \(k\)-factor
    0 references
    fractional \((k, m)\)-deleted graph
    0 references

    Identifiers