Degree sequences and the existence of \(k\)-factors (Q1926057): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 0912.2916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reguläre Faktoren von Graphen. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Kundu's k-factor theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton's ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and the existence ofk-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for constructing graphs and digraphs with given valences and factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On small contractible subgraphs in 3-connected graphs of small average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k-factor conjecture is true / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valencies of graphs with 1-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors and factorization: 1985--2003: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factors of Graphs / rank
 
Normal rank

Latest revision as of 01:09, 6 July 2024

scientific article
Language Label Description Also known as
English
Degree sequences and the existence of \(k\)-factors
scientific article

    Statements

    Degree sequences and the existence of \(k\)-factors (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 December 2012
    0 references
    0 references
    \(k\)-factor graphical degree sequence
    0 references
    best monotone degree condition
    0 references
    nonredundant conditions
    0 references
    0 references
    0 references