Literatura académica sobre el tema "Anti-Ramsey number"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Índice
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Anti-Ramsey number".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Anti-Ramsey number"
Gorgol, Izolda y Anna Lechowska. "Anti-Ramsey number of Hanoi graphs". Discussiones Mathematicae Graph Theory 39, n.º 1 (2019): 285. http://dx.doi.org/10.7151/dmgt.2078.
Texto completoHaas, Ruth y Michael Young. "The anti-Ramsey number of perfect matching". Discrete Mathematics 312, n.º 5 (marzo de 2012): 933–37. http://dx.doi.org/10.1016/j.disc.2011.10.017.
Texto completoÖzkahya, Lale y Michael Young. "Anti-Ramsey number of matchings in hypergraphs". Discrete Mathematics 313, n.º 20 (octubre de 2013): 2359–64. http://dx.doi.org/10.1016/j.disc.2013.06.015.
Texto completoFang, Chunqiu, Ervin Győri, Mei Lu y Jimeng Xiao. "On the anti-Ramsey number of forests". Discrete Applied Mathematics 291 (marzo de 2021): 129–42. http://dx.doi.org/10.1016/j.dam.2020.08.027.
Texto completo余, 婷. "Anti-Ramsey Number of 4-Cycle in Complete Multipartite Graphs". Advances in Applied Mathematics 10, n.º 07 (2021): 2378–84. http://dx.doi.org/10.12677/aam.2021.107249.
Texto completoAxenovich, Maria, Tao Jiang y Z. Tuza. "Local Anti-Ramsey Numbers of Graphs". Combinatorics, Probability and Computing 12, n.º 5-6 (noviembre de 2003): 495–511. http://dx.doi.org/10.1017/s0963548303005868.
Texto completo周, 韦佳. "The Anti-Ramsey Number of Trees in Maximal Out-Planar Graph". Advances in Applied Mathematics 13, n.º 01 (2024): 169–75. http://dx.doi.org/10.12677/aam.2024.131020.
Texto completoXiang, Changyuan, Yongxin Lan, Qinghua Yan y Changqing Xu. "The Outer-Planar Anti-Ramsey Number of Matchings". Symmetry 14, n.º 6 (16 de junio de 2022): 1252. http://dx.doi.org/10.3390/sym14061252.
Texto completoJin, Zemin, Rui Yu y Yuefang Sun. "Anti-Ramsey number of matchings in outerplanar graphs". Discrete Applied Mathematics 345 (marzo de 2024): 125–35. http://dx.doi.org/10.1016/j.dam.2023.11.049.
Texto completoJin, Zemin, Oothan Nweit, Kaijun Wang y Yuling Wang. "Anti-Ramsey numbers for matchings in regular bipartite graphs". Discrete Mathematics, Algorithms and Applications 09, n.º 02 (abril de 2017): 1750019. http://dx.doi.org/10.1142/s1793830917500197.
Texto completoTesis sobre el tema "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.
Texto completoGraph 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.
Texto completo