Rainbow matchings and cycle-free partial transversals of Latin squares (Q2449167): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4177580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the length of a partial transversal in a Latin square / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on large rainbow matchings in edge-coloured graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the length of a partial transversal in a Latin square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow matchings in properly edge colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of rainbow matchings in properly edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols / rank
 
Normal rank

Revision as of 12:28, 8 July 2024

scientific article
Language Label Description Also known as
English
Rainbow matchings and cycle-free partial transversals of Latin squares
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references