1-factor covers of regular graphs (Q628309): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2010.12.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987960364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3423978 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:20, 3 July 2024

scientific article
Language Label Description Also known as
English
1-factor covers of regular graphs
scientific article

    Statements

    1-factor covers of regular graphs (English)
    0 references
    0 references
    10 March 2011
    0 references
    perfect matching
    0 references
    1-factor
    0 references
    excessive factorization
    0 references
    overfull
    0 references

    Identifiers