Coloring decompositions of complete geometric graphs
Visualitza/Obre
Cita com:
hdl:2117/176836
Tipus de documentArticle
Data publicació2019-06-25
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
ProjecteGRAFOS Y GEOMETRIA: INTERACCIONES Y APLICACIONES (MINECO-MTM2015-63791-R)
CONNECT - Combinatorics of Networks and Computation (EC-H2020-734922)
CONNECT - Combinatorics of Networks and Computation (EC-H2020-734922)
Abstract
A decomposition of a non-empty simple graph G is a pair [G,P] such that P is a set of non-empty induced subgraphs of G, and every edge of G belongs to exactly one subgraph in P. The chromatic index ¿'([G,P]) of a decomposition [G,P] is the smallest number k for which there exists a k-coloring of the elements of P in such a way that for every element of P all of its edges have the same color, and if two members of P share at least one vertex, then they have different colors. A long standing conjecture of Erdos–Faber–Lovász states that every decomposition [Kn,P] of the complete graph Kn satisfies ¿'([Kn,P])=n. In this paper we work with geometric graphs, and inspired by this formulation of the conjecture, we introduce the concept of chromatic index of a decomposition of the complete geometric graph. We present bounds for the chromatic index of several types of decompositions when the vertices of the graph are in general position. We also consider the particular case when the vertices are in convex position and present bounds for the chromatic index of a few types of decompositions.
Descripció
This is a post-peer-review, pre-copyedit version of an article published in Acta Mathematica Hungarica. The final authenticated version is available online at: https://doi.org/10.1007/s10474-019-00963-0
CitacióHuemer, C.; Lara, D.; Rubio-Montiel, C. Coloring decompositions of complete geometric graphs. "Acta mathematica hungarica", 25 Juny 2019, vol. 159, p. 429-446.
ISSN0236-5294
Versió de l'editorhttps://link.springer.com/article/10.1007/s10474-019-00963-0
Altres identificadorshttps://arxiv.org/pdf/1610.01676.pdf
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
coloring_decompositions.pdf | 517,0Kb | Visualitza/Obre |