A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs (Q548404): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 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.aml.2011.03.041 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080172880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (<i>k</i>, <i>m</i>)-DELETED GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF <i>k</i>-FACTORS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence number, connectivity and \((a,b,k)\)-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEIGHBOURHOODS OF INDEPENDENT SETS FOR (<i>a</i>,<i>b</i>,<i>k</i>)-CRITICAL GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks about factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and the existence of fractional \(k\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fractional \((f,n)\)-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on fractional \(k\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4650004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood conditions and fractional \(k\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5062710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional \((g,f)\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5419830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A result on fractional $k$-deleted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its Anderson number / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:13, 4 July 2024

scientific article
Language Label Description Also known as
English
A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
scientific article

    Statements

    A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs (English)
    0 references
    28 June 2011
    0 references
    graph
    0 references
    binding number
    0 references
    \(k\)-factor
    0 references
    fractional \(k\)-factor
    0 references
    fractional (\(k\)
    0 references
    0 references

    Identifiers