On the number of disjoint perfect matchings of regular graphs with given edge connectivity (Q729759): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Proof of the $1$-factorization and Hamilton Decomposition Conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizations of regular graphs of high degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizations of regular graphs / rank
 
Normal rank

Revision as of 04:35, 13 July 2024

scientific article
Language Label Description Also known as
English
On the number of disjoint perfect matchings of regular graphs with given edge connectivity
scientific article

    Statements

    On the number of disjoint perfect matchings of regular graphs with given edge connectivity (English)
    0 references
    0 references
    0 references
    22 December 2016
    0 references
    edge disjoint perfect matching
    0 references
    1-factorization conjecture
    0 references

    Identifiers