Sufficient conditions for a graph to have factors (Q803162): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Factors and factorizations of graphs—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular factors in nearly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factorisation of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On defect-d matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: [a,b]-factorization of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with prescribed valencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factors of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors / rank
 
Normal rank

Latest revision as of 15:58, 21 June 2024

scientific article
Language Label Description Also known as
English
Sufficient conditions for a graph to have factors
scientific article

    Statements

    Sufficient conditions for a graph to have factors (English)
    0 references
    0 references
    1990
    0 references
    This paper contains results (sufficient conditions) on the existence in a graph of an f-factor or a (g,f)-factor, g and f being integer-valued functions defined on the vertex set of the graph.
    0 references
    factor of a graph
    0 references

    Identifiers