An anti-Ramsey theorem on cycles (Q2573806): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q932667
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Víctor Neumann-Lara / 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-005-0619-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028312736 / 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 minimum size of tight hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hamiltonian path graph of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal colorings for properly colored subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anti-Ramsey theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear heterochromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted colourings of \(K_ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest 3-graphs having a 3-colored edge in every k-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panconnected graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for Circuits in Graphs<sup>†</sup> / rank
 
Normal rank

Latest revision as of 13:20, 11 June 2024