International audienceA graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges in a graph any of whose proper edge colorings contains a totally multicolored copy of a graph H is the size anti-Ramsey number ARs(H) of H. This number in offline and online setting is investigated here
Abstract We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used mo...
The anti-Ramsey number ARG,H is the maximum number of colors in an edge-coloring of G such that G co...
The size-Ramsey number of a graph G is the minimum number of edges in a graph H such that every 2-ed...
International audienceA graph is properly edge-colored if no two adjacent edges have the same color....
A copy of a graph H in an edge colored graph G is called rainbow if all edges of H have distinct col...
A subgraph H in an edge-colouring is properly coloured if incident edges of H are assigned different...
Given a graph L, in this paper we investigate the anti-Ramsey number S (n; e; L), de ned to be th...
A subgraph of an edge-colored graph is rainbow if all of its edges have dierent colors. For a graph ...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
Given a graph H and a positive integer n, Anti-Ramsey number AR(n, H) is the maximum number of color...
DOI 10.1002/jgt.20380 Abstract: Given a graph H and a positive integer n, Anti-Ramsey number AR(n,H)...
A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. For a grap...
AbstractAn r-edge coloring of a graph G is a mapping h:E(G)→[r], where h(e) is the color assigned to...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
Abstract We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used mo...
The anti-Ramsey number ARG,H is the maximum number of colors in an edge-coloring of G such that G co...
The size-Ramsey number of a graph G is the minimum number of edges in a graph H such that every 2-ed...
International audienceA graph is properly edge-colored if no two adjacent edges have the same color....
A copy of a graph H in an edge colored graph G is called rainbow if all edges of H have distinct col...
A subgraph H in an edge-colouring is properly coloured if incident edges of H are assigned different...
Given a graph L, in this paper we investigate the anti-Ramsey number S (n; e; L), de ned to be th...
A subgraph of an edge-colored graph is rainbow if all of its edges have dierent colors. For a graph ...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
Given a graph H and a positive integer n, Anti-Ramsey number AR(n, H) is the maximum number of color...
DOI 10.1002/jgt.20380 Abstract: Given a graph H and a positive integer n, Anti-Ramsey number AR(n,H)...
A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. For a grap...
AbstractAn r-edge coloring of a graph G is a mapping h:E(G)→[r], where h(e) is the color assigned to...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
Abstract We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used mo...
The anti-Ramsey number ARG,H is the maximum number of colors in an edge-coloring of G such that G co...
The size-Ramsey number of a graph G is the minimum number of edges in a graph H such that every 2-ed...
DOI
Add to ORKG