The rainbow number of matchings in regular bipartite graphs (Q735110): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted colourings of \(K_ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anti-Ramsey theorem on cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite anti-Ramsey numbers of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow numbers for matchings and complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite rainbow numbers of matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete solution for the rainbow numbers of matchings / rank
 
Normal rank

Revision as of 00:59, 2 July 2024

scientific article
Language Label Description Also known as
English
The rainbow number of matchings in regular bipartite graphs
scientific article

    Statements

    The rainbow number of matchings in regular bipartite graphs (English)
    0 references
    14 October 2009
    0 references
    edge-colored graph
    0 references
    rainbow subgraph
    0 references
    rainbow number
    0 references
    matching
    0 references
    regular bipartite graph
    0 references
    0 references
    0 references

    Identifiers