Добірка наукової літератури з теми "Anti-Ramsey number"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Зміст
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Anti-Ramsey number".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Anti-Ramsey number"
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.
Повний текст джерелаHaas, Ruth, and Michael Young. "The anti-Ramsey number of perfect matching." Discrete Mathematics 312, no. 5 (March 2012): 933–37. http://dx.doi.org/10.1016/j.disc.2011.10.017.
Повний текст джерелаÖzkahya, Lale, and Michael Young. "Anti-Ramsey number of matchings in hypergraphs." Discrete Mathematics 313, no. 20 (October 2013): 2359–64. http://dx.doi.org/10.1016/j.disc.2013.06.015.
Повний текст джерела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.
Повний текст джерела余, 婷. "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.
Повний текст джерелаAxenovich, Maria, Tao Jiang, and Z. Tuza. "Local Anti-Ramsey Numbers of Graphs." Combinatorics, Probability and Computing 12, no. 5-6 (November 2003): 495–511. http://dx.doi.org/10.1017/s0963548303005868.
Повний текст джерела周, 韦佳. "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.
Повний текст джерелаXiang, Changyuan, Yongxin Lan, Qinghua Yan, and Changqing Xu. "The Outer-Planar Anti-Ramsey Number of Matchings." Symmetry 14, no. 6 (June 16, 2022): 1252. http://dx.doi.org/10.3390/sym14061252.
Повний текст джерела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.
Повний текст джерела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 (April 2017): 1750019. http://dx.doi.org/10.1142/s1793830917500197.
Повний текст джерелаДисертації з теми "Anti-Ramsey number"
Ouyang, Qiancheng. "Some colouring problems in edge/vertex-coloured graphs : Structural and extremal studies." Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG060.
Повний текст джерелаGraph colouring is one of the best known, popular and extensively researched subject in the field of graph theory, having a wide literature with approaches from many domains and a lot of problems, which are still open and studied by various mathematicians and computer scientists along the world. The Four Colour Problem, originating the study of graph colouring, was one of the central problem in graph theory in the last century, which asks if it is possible to colour every planar graph properly by four colours. Despite the theoretical origin, the graph colouring has found many applications in practice like scheduling, frequency assignment problems, segmentation, etc. The Four Colour Problem is a significant one among many problems in chromatic graph theory, from which many variants and generalizations have been proposed. Firstly, in this thesis, we aim to optimize the strategy to colour the vertex of graphs and hypergraphs with some given constraints, which combines the concept of proper colouring and representative element of some vertex subsets. On the other hand, according to the subject to be coloured, a large amount of research and problems of edge-coloured graphs have emerged, which have important applications to biology and web technologies. We provide some analogous results for some connectivity issues—to describe graphs whose edges are assigned enough colours, that guarantee spanning trees or cycles of a specific chromatic structure
Hashim, Talha. "Improved approximation bounds on maximum edge q coloring of dense graphs." Thesis, 2023. https://etd.iisc.ac.in/handle/2005/6089.
Повний текст джерела