Bipartite anti-Ramsey numbers of cycles (Q3156920): 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.1002/jgt.20012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2599363141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalized anti-Ramsey problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colorings with no large polychromatic stars / 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: An anti-Ramsey theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted edge-colorings of bicliques / rank
 
Normal rank

Latest revision as of 16:16, 7 June 2024

scientific article
Language Label Description Also known as
English
Bipartite anti-Ramsey numbers of cycles
scientific article

    Statements

    Bipartite anti-Ramsey numbers of cycles (English)
    0 references
    0 references
    0 references
    0 references
    12 January 2005
    0 references
    Bipartite graph
    0 references
    anti-Ramsey problem
    0 references
    cycle
    0 references

    Identifiers