Por favor, use este identificador para citar o enlazar este ítem:
http://infotec.repositorioinstitucional.mx/jspui/handle/1027/415| The chromatic number of the disjointness graph of the double chain | |
| RUY FABILA MONROY Carlos Hidalgo_Toscano Jesús Leaños Mario Lomeli | |
| Acceso Abierto | |
| Atribución | |
| https://dmtcs.episciences.org/6209 | |
| https://doi.org/10.23638/DMTCS-22-1-11 | |
| Chromatic number Double chain Edge disjointness graph | |
| Let P be a set of n ≥ 4 points in general position in the plane. Consider all the closed straight line segments with both end points in P. Suppose that these segments are colored with the rule that disjoint segments receive different colors. In this paper we show that if P is the point configuration known as jq the double chain, k with k points in the upper convex chain and l ≥ k points in the lower convex chain, then k + l − that this number is sufficient. Véase reporte "1.1.1.1 Número de publicaciones arbitradas. Enero - Junio de 2020": http://infotec.repositorioinstitucional.mx/jspui/handle/1027/421 | |
| Discrete Mathematics and Theoretical Computer Science | |
| 22-03-2020 | |
| Artículo | |
| Discrete Mathematics and Theoretical Computer Science, Volume 22, Issue 1, 2020, number 11 | |
| Inglés | |
| Fabila Monroy, R., Hidalgo Toscano, C., Leaños, J., Lomelí Haro, M., 2020. The Chromatic Number of the Disjointness Graph of the Double Chain. Discrete Mathematics and Theoretical Computer Science 22:1, 11. https://doi.org/10.23638/DMTCS-22-1-11 | |
| OTRAS | |
| Versión publicada | |
| publishedVersion - Versión publicada | |
| Aparece en las colecciones: | Artículos |
Cargar archivos:
| Fichero | Tamaño | Formato | |
|---|---|---|---|
| The Chromatic Number of the Disjointness Graph of the Doble Chain.pdf | 367.16 kB | Adobe PDF | Visualizar/Abrir |