Maximum fractional factors in graphs (Q2472791): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aml.2007.02.004 / rank
Normal rank
 
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4887674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected \([k,k+1]\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum \((g,f)\)-factors of a general graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and the existence ofk-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382863 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AML.2007.02.004 / rank
 
Normal rank

Latest revision as of 20:40, 18 December 2024

scientific article
Language Label Description Also known as
English
Maximum fractional factors in graphs
scientific article

    Statements

    Maximum fractional factors in graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 February 2008
    0 references
    fractional \(k\)-factor
    0 references
    connected fractional factor
    0 references
    increasing walk
    0 references
    1-factor
    0 references
    toughness
    0 references

    Identifiers