Smallest close to regular bipartite graphs without an almost perfect matching (Q606288): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3921259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5487913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the order of certain close to regular graphs without a matching of given size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862678 / rank
 
Normal rank

Latest revision as of 12:12, 3 July 2024

scientific article
Language Label Description Also known as
English
Smallest close to regular bipartite graphs without an almost perfect matching
scientific article

    Statements

    Smallest close to regular bipartite graphs without an almost perfect matching (English)
    0 references
    0 references
    0 references
    17 November 2010
    0 references
    0 references
    almost perfect matching
    0 references
    bipartite graph
    0 references
    close to regular graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references