Relevant bibliographies by topics / Anti-Ramsey number

Contents

  1. Journal articles

Academic literature on the topic 'Anti-Ramsey number'

Author: Grafiati
Published: 6 September 2023
Last updated: 25 May 2024

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 'Anti-Ramsey 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 "Anti-Ramsey number"

1

Gorgol, Izolda, and Anna Lechowska. "Anti-Ramsey number of Hanoi graphs." Discussiones Mathematicae Graph Theory 39, no. 1 (2019): 285. http://dx.doi.org/10.7151/dmgt.2078.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Haas, Ruth, and Michael Young. "The anti-Ramsey number of perfect matching." Discrete Mathematics 312, no. 5 (2012): 933–37. http://dx.doi.org/10.1016/j.disc.2011.10.017.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Özkahya, Lale, and Michael Young. "Anti-Ramsey number of matchings in hypergraphs." Discrete Mathematics 313, no. 20 (2013): 2359–64. http://dx.doi.org/10.1016/j.disc.2013.06.015.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Fang, Chunqiu, Ervin Győri, Mei Lu, and Jimeng Xiao. "On the anti-Ramsey number of forests." Discrete Applied Mathematics 291 (March 2021): 129–42. http://dx.doi.org/10.1016/j.dam.2020.08.027.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

余, 婷. "Anti-Ramsey Number of 4-Cycle in Complete Multipartite Graphs." Advances in Applied Mathematics 10, no. 07 (2021): 2378–84. http://dx.doi.org/10.12677/aam.2021.107249.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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
7

周, 韦佳. "The Anti-Ramsey Number of Trees in Maximal Out-Planar Graph." Advances in Applied Mathematics 13, no. 01 (2024): 169–75. http://dx.doi.org/10.12677/aam.2024.131020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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
9

Jin, Zemin, Rui Yu, and Yuefang Sun. "Anti-Ramsey number of matchings in outerplanar graphs." Discrete Applied Mathematics 345 (March 2024): 125–35. http://dx.doi.org/10.1016/j.dam.2023.11.049.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Jin, Zemin, Oothan Nweit, Kaijun Wang, and Yuling Wang. "Anti-Ramsey numbers for matchings in regular bipartite graphs." Discrete Mathematics, Algorithms and Applications 09, no. 02 (2017): 1750019. http://dx.doi.org/10.1142/s1793830917500197.

Full text
Abstract:
Let [Formula: see text] be a family of graphs. The anti-Ramsey number [Formula: see text] for [Formula: see text] in the graph [Formula: see text] is the maximum number of colors in an edge coloring of [Formula: see text] that does not have any rainbow copy of any graph in [Formula: see text]. In this paper, we consider the anti-Ramsey number for matchings in regular bipartite graphs and determine its value under several conditions.
APA, Harvard, Vancouver, ISO, and other styles
More sources
You might also be interested in the extended bibliographies on the topic 'Anti-Ramsey number' for particular source types:
Journal articles
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!

To the bibliography