Graphs with the maximum or minimum number of 1-factors (Q965940): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The maximum number of perfect matchings in graphs with a given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for the gamma function with applications to permanents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of graphs by their number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities: theory of majorization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new technique for the characterization of graphs with a maximum number of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reliability-improving graph transformation with applications to network reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the number of spanning trees in a graph with n nodes and m edges / rank
 
Normal rank

Latest revision as of 19:16, 2 July 2024

scientific article
Language Label Description Also known as
English
Graphs with the maximum or minimum number of 1-factors
scientific article

    Statements

    Graphs with the maximum or minimum number of 1-factors (English)
    0 references
    0 references
    0 references
    0 references
    27 April 2010
    0 references
    0 references
    \(k\)-factor
    0 references
    1-factor
    0 references
    perfect matching
    0 references
    degree sequence
    0 references
    0 references