Maximum \((g,f)\)-factors of a general graph (Q1179272): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and factorizations of graphs—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5656790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with prescribed valencies / rank
 
Normal rank

Latest revision as of 12:44, 15 May 2024

scientific article
Language Label Description Also known as
English
Maximum \((g,f)\)-factors of a general graph
scientific article

    Statements

    Maximum \((g,f)\)-factors of a general graph (English)
    0 references
    0 references
    26 June 1992
    0 references
    maximum \((g,f)\)-factors
    0 references
    minimum \((g,f)\)-factors
    0 references

    Identifiers