General fractional \(f\)-factor numbers of graphs (Q617025): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aml.2010.11.005 / 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.2010.11.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969726110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with prescribed valencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fractional matching numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive proof of deficiency theorem of \((g,f)\)-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified existence theorems for \((g,f)\)-factors / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AML.2010.11.005 / rank
 
Normal rank

Latest revision as of 05:07, 9 December 2024

scientific article
Language Label Description Also known as
English
General fractional \(f\)-factor numbers of graphs
scientific article

    Statements

    General fractional \(f\)-factor numbers of graphs (English)
    0 references
    0 references
    0 references
    20 January 2011
    0 references
    fractional matching
    0 references
    \(f\)-factor
    0 references
    fractional number
    0 references
    deficiency
    0 references
    alternating trail
    0 references

    Identifiers