<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1409-2433</journal-id>
<journal-title><![CDATA[Revista de Matemática Teoría y Aplicaciones]]></journal-title>
<abbrev-journal-title><![CDATA[Rev. Mat]]></abbrev-journal-title>
<issn>1409-2433</issn>
<publisher>
<publisher-name><![CDATA[Centro de Investigaciones en Matemática Pura y Aplicada (CIMPA) y Escuela de Matemática, San José, Costa Rica.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1409-24332015000200311</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Coloración de gráficas suaves]]></article-title>
<article-title xml:lang="en"><![CDATA[Soft graph coloring]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Lara-Velázquez]]></surname>
<given-names><![CDATA[Pedro]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Gutiérrez-Andrade]]></surname>
<given-names><![CDATA[Miguel Ángel]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[De-Los-Cobos-Silva]]></surname>
<given-names><![CDATA[Sergio G.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rincón-García]]></surname>
<given-names><![CDATA[Eric Alfredo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Autónoma Metropolitana-Iztapalapa Departamento de Ingeniería Eléctrica ]]></institution>
<addr-line><![CDATA[Iztapalapa México D.F.]]></addr-line>
<country>MX</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Autónoma Metropolitana-Iztapalapa Departamento de Ingeniería Eléctrica ]]></institution>
<addr-line><![CDATA[Iztapalapa México D.F.]]></addr-line>
<country>MX</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Autónoma Metropolitana-Iztapalapa Departamento de Ingeniería Eléctrica ]]></institution>
<addr-line><![CDATA[Iztapalapa México D.F.]]></addr-line>
<country>MX</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Universidad Autónoma Metropolitana-Azcapotzalco Departamento de Sistemas ]]></institution>
<addr-line><![CDATA[ México D.F.]]></addr-line>
<country>MX</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2015</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2015</year>
</pub-date>
<volume>22</volume>
<numero>2</numero>
<fpage>311</fpage>
<lpage>323</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_arttext&amp;pid=S1409-24332015000200311&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_abstract&amp;pid=S1409-24332015000200311&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_pdf&amp;pid=S1409-24332015000200311&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[ResumenEn este trabajo se propone un modelo de Coloración en Gráficas Suaves donde se colorea con base en ponderaciones sobre las aristas de la gráfica. Se muestra que este modelo es muy flexible e incluye otros problemas similares, tales como los problemas de Coloración Mínima, Coloración Equitativa, Coloración de Gráficas Débiles y Coloración Robusta. Se proponen también un modelo binario lineal de solución y algunas instancias de prueba.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[AbstractIn this paper a Soft Graph Coloring Model is proposed, which is colored based on weights on the edges of the graph. It is shown that this model is very flexible and includes other similar problems such as Minimal, Equitable, Weak, and Robust Graph Coloring. A linear binary solution model and some test instances are also proposed.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[coloración de graficas suaves]]></kwd>
<kwd lng="es"><![CDATA[teoría de graficas]]></kwd>
<kwd lng="es"><![CDATA[coloración sobre vértices]]></kwd>
<kwd lng="en"><![CDATA[soft graph coloring]]></kwd>
<kwd lng="en"><![CDATA[graph theory]]></kwd>
<kwd lng="en"><![CDATA[coloring on vertexes]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA["Automated university timetabling: the state of the art"]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Jackson]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Kingston]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Weare]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Comput. J]]></source>
<year>1997</year>
<volume>40</volume>
<page-range>565-71</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA["Recent research directions in automated timetabling"]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Petrovic]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Eur. J. Opl. Res]]></source>
<year>2002</year>
<volume>140</volume>
<page-range>266-80</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA["Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths"]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cangalovic]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Schreuder]]></surname>
<given-names><![CDATA[J.A.M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Eur. J. Opl. Res]]></source>
<year>1991</year>
<volume>51</volume>
<page-range>248-58</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carter]]></surname>
<given-names><![CDATA[M.W.]]></given-names>
</name>
<name>
<surname><![CDATA[Laporte]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["Recent developments in practical course timetabling"]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Carter]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Practice and Theory of Automated Timetabling II]]></source>
<year>1998</year>
<conf-name><![CDATA[ Second International Conference, PATAT'97]]></conf-name>
<conf-loc>Toronto, Canada </conf-loc>
<page-range>3-19</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA["Defective Coloring Revisited"]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cowen]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Goddard]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Jesurum]]></surname>
<given-names><![CDATA[C.E.]]></given-names>
</name>
</person-group>
<source><![CDATA[J. Graph. Theory]]></source>
<year>1997</year>
<volume>24</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>205-19</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diestel]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Graph Theory]]></source>
<year>2000</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kuhn]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA["Weak graph colorings: distributed algorithms and applications"]]></source>
<year>2009</year>
<page-range>138-44</page-range><publisher-loc><![CDATA[Alberta, Canada ]]></publisher-loc>
<publisher-name><![CDATA[Calgary]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA["Setting the research agenda in automated timetabling: the Second International Timetabling Competition"]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[McCollum]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Schaerf]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Paechter]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[McMullan]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Lewis]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Parkes]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Di Gaspero]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Qu]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[INFORMS Journal on Computing]]></source>
<year>2009</year>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA["Equitable coloring"]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Meyer]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<source><![CDATA[American Mathematical Monthly (Mathematical Association of America)]]></source>
<year>1973</year>
<volume>80</volume>
<page-range>920-2</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA["A survey of simulated annealing methodology for university course timetabling"]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nandhini]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kanmani]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[International Journal of Recent Trends in Engineering]]></source>
<year>2009</year>
<volume>1</volume>
<page-range>255-7</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ramírez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Extensiones del problema de coloración de gráfos]]></source>
<year>2001</year>
<publisher-loc><![CDATA[Madrid, España ]]></publisher-loc>
<publisher-name><![CDATA[Universidad Complutense de Madrid]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[T-colorings of graphs: recent results and open problemsÂ´Â´]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Roberts]]></surname>
<given-names><![CDATA[F.S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Discrete Math]]></source>
<year>1991</year>
<volume>93</volume>
<page-range>229-45</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA["Heuristics for robust graph coloring"]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[J. Heuristics]]></source>
<year>2013</year>
<volume>19</volume>
<page-range>529-48</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA["The robust coloring problem"]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yañez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramírez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2003</year>
<volume>148</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>546-58</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
