Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings (Q2334066): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00373-019-02053-y / rank
Normal rank
 
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.1007/s00373-019-02053-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2954615188 / 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: Bipartite anti-Ramsey numbers of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2732627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete solution for the rainbow numbers of matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton's ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow generalizations of Ramsey theory: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The anti-Ramsey number of perfect matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-Ramsey Problems for <i>t</i> Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5405504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-Ramsey numbers of subdivided graphs / 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: Edge-colorings of complete graphs that avoid polychromatic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-Ramsey numbers for graphs with independent cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2931471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rainbow number of matchings in regular bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite rainbow numbers of matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anti-Ramsey theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anti-Ramsey theorem on 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: On restricted colourings of \(K_ n\) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00373-019-02053-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:41, 18 December 2024

scientific article
Language Label Description Also known as
English
Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
scientific article

    Statements

    Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings (English)
    0 references
    0 references
    6 November 2019
    0 references
    complete bipartite graph
    0 references
    anti-Ramsey problem
    0 references
    Hamiltonian cycle
    0 references
    perfect matching
    0 references

    Identifiers

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