Log in

Relevant bibliographies by topics / Rainbow Ramsety Number

Contents

Journal articles

Academic literature on the topic 'Rainbow Ramsety Number'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Rainbow Ramsety Number.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Rainbow Ramsety Number"

1

Ramireddy, B., Mohan Chand, Sri Krishna Chaitanya, and B. R. Srinivas. "APPLICATIONS OF EDGE COLORING OF GRAPHS WITH RAINBOW NUMBERS PHENOMENA." International Journal of Research -GRANTHAALAYAH 3, no. 12 (2015): 163–70. http://dx.doi.org/10.29121/granthaalayah.v3.i12.2015.2901.

Full text

Abstract:

This paper studies the Rainbow Ramsety Number for a non empty graph and the main results are 1. The Rainbow Ramsety Number of a graph F with out isolated vertices is defined if and only if F is a forest. 2. The Rainbow Ramsety Number of two graphs F1 and F2 with out isolated vertices is defined if and only if F1 is a star or F2 is a forest.

APA, Harvard, Vancouver, ISO, and other styles

2

Dr., B. Ramireddy, Mohan Chand U., Sri Krishna Chaitanya A., and Sri Krishna Chaitanya A. "APPLICATIONS OF EDGE COLORING OF GRAPHS WITH RAINBOW NUMBERS PHENOMENA." International Journal of Research – Granthaalayah 3, no. 12 (2017): 163–70. https://doi.org/10.5281/zenodo.848967.

Full text

Abstract:

This paper studies the Rainbow Ramsety Number for a non empty graph and the main results are 1. The Rainbow Ramsety Number of a graph F with out isolated vertices is defined if and only if F is a forest. 2. The Rainbow Ramsety Number of two graphs F1 and F2 with out isolated vertices is defined if and only if F1 is a star or F2 is a forest..

APA, Harvard, Vancouver, ISO, and other styles

3

Eroh, Linda, and Ortrud R. Oellermann. "Bipartite rainbow Ramsey numbers." Discrete Mathematics 277, no. 1-3 (2004): 57–72. http://dx.doi.org/10.1016/s0012-365x(03)00154-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Axenovich, Maria, Tao Jiang, and Z. Tuza. "Local Anti-Ramsey Numbers of Graphs." Combinatorics, Probability and Computing 12, no. 5-6 (2003): 495–511. http://dx.doi.org/10.1017/s0963548303005868.

Full text

Abstract:

A subgraph H in an edge-colouring is properly coloured if incident edges of H are assigned different colours, and H is rainbow if no two edges of H are assigned the same colour. We study properly coloured subgraphs and rainbow subgraphs forced in edge-colourings of complete graphs in which each vertex is incident to a large number of colours.

APA, Harvard, Vancouver, ISO, and other styles

5

LOH, PO-SHEN, and BENNY SUDAKOV. "Constrained Ramsey Numbers." Combinatorics, Probability and Computing 18, no. 1-2 (2009): 247–58. http://dx.doi.org/10.1017/s0963548307008875.

Full text

Abstract:

For two graphs S and T, the constrained Ramsey number f(S, T) is the minimum n such that every edge colouring of the complete graph on n vertices (with any number of colours) has a monochromatic subgraph isomorphic to S or a rainbow subgraph isomorphic to T. Here, a subgraph is said to be rainbow if all of its edges have different colours. It is an immediate consequence of the Erdős–Rado Canonical Ramsey Theorem that f(S, T) exists if and only if S is a star or T is acyclic. Much work has been done to determine the rate of growth of f(S, T) for various types of parameters. When S and T are bot

APA, Harvard, Vancouver, ISO, and other styles

6

Gorgol, Izolda. "Avoiding rainbow 2-connected subgraphs." Open Mathematics 15, no. 1 (2017): 393–97. http://dx.doi.org/10.1515/math-2017-0035.

Full text

Abstract:

Abstract While defining the anti-Ramsey number Erdős, Simonovits and Sós mentioned that the extremal colorings may not be unique. In the paper we discuss the uniqueness of the colorings, generalize the idea of their construction and show how to use it to construct the colorings of the edges of complete split graphs avoiding rainbow 2-connected subgraphs. These colorings give the lower bounds for adequate anti-Ramsey numbers.

APA, Harvard, Vancouver, ISO, and other styles

7

Wang, Ye, and Yusheng Li. "Bounds for Bipartite Rainbow Ramsey Numbers." Graphs and Combinatorics 33, no. 4 (2017): 1065–79. http://dx.doi.org/10.1007/s00373-017-1794-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Li, Xihe, Pierre Besse, Colton Magnant, Ligong Wang, and Noah Watts. "Gallai–Ramsey Numbers for Rainbow Paths." Graphs and Combinatorics 36, no. 4 (2020): 1163–75. http://dx.doi.org/10.1007/s00373-020-02175-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lo, Allan Siu Lun. "Constrained Ramsey numbers for rainbow matching." Journal of Graph Theory 67, no. 2 (2010): 91–95. http://dx.doi.org/10.1002/jgt.20517.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Xiang, Changyuan, Yongxin Lan, Qinghua Yan, and Changqing Xu. "The Outer-Planar Anti-Ramsey Number of Matchings." Symmetry 14, no. 6 (2022): 1252. http://dx.doi.org/10.3390/sym14061252.

Full text

Abstract:

A subgraph H of an edge-colored graph G is called rainbow if all of its edges have different colors. Let ar(G,H) denote the maximum positive integer t, such that there is a t-edge-colored graph G without any rainbow subgraph H. We denote by kK2 a matching of size k and On the class of all maximal outer-planar graphs on n vertices, respectively. The outer-planar anti-Ramsey number of graph H, denoted by ar(On,H), is defined as max{ar(On,H)|On∈On}. It seems nontrivial to determine the exact values for ar(On,H) because most maximal outer-planar graphs are asymmetry. In this paper, we obtain that

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!