Minimal 2-matching-covered graphs (Q1043944): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2009.01.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037607578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularisable graphs I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matching problem with side conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum square-free 2-matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal elementary bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factors of Graphs / rank
 
Normal rank

Latest revision as of 07:24, 2 July 2024

scientific article
Language Label Description Also known as
English
Minimal 2-matching-covered graphs
scientific article

    Statements

    Minimal 2-matching-covered graphs (English)
    0 references
    0 references
    0 references
    10 December 2009
    0 references
    0 references
    perfect 2-matching
    0 references
    2-matching-covered graph
    0 references
    minimal 2-matching-covered graph
    0 references
    0 references