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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5914137 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph
Property / zbMATH Keywords: graph / rank
 
Normal rank
Property / zbMATH Keywords
 
binding number
Property / zbMATH Keywords: binding number / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-factor
Property / zbMATH Keywords: \(k\)-factor / rank
 
Normal rank
Property / zbMATH Keywords
 
fractional \(k\)-factor
Property / zbMATH Keywords: fractional \(k\)-factor / rank
 
Normal rank
Property / zbMATH Keywords
 
fractional (\(k\)
Property / zbMATH Keywords: fractional (\(k\) / rank
 
Normal rank

Revision as of 12:59, 1 July 2023

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
    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

    Identifiers