A toughness condition for fractional \((k,m)\)-deleted graphs (Q2377232): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Si-zhong Zhou / rank
Normal rank
 
Property / author
 
Property / author: Si-zhong Zhou / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2013.01.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008496735 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:39, 19 March 2024

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