<?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>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462022000200815</article-id>
<article-id pub-id-type="doi">10.13053/cys-26-2-4250</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Computing the Clique-Width on Series-Parallel Graphs]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[López-Medina]]></surname>
<given-names><![CDATA[Marco Antonio]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[González-Ruiz]]></surname>
<given-names><![CDATA[J. Leonardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Marcial-Romero]]></surname>
<given-names><![CDATA[J.Raymundo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Hernández]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Autónoma del Estado de México Facultad de Ingeniería ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2022</year>
</pub-date>
<volume>26</volume>
<numero>2</numero>
<fpage>815</fpage>
<lpage>822</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462022000200815&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462022000200815&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462022000200815&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: The clique-width    (  c w d ) is an invariant of graphs which, similar to other invariants like the tree-width    (  t w d ) establishes a parameter for the complexity of a problem. For example, several problems with bounded clique-width can be solved in polynomial time. There is a well known relation between tree-width and clique-width denoted as   c w d  ( G ) &#8804; 3 &#8901;  2  t w d  ( G ) &#8722; 1. Serial-parallel graphs have tree-width of at most 2, so its clique&#8211;width is at most 6 according to the previous relation. In this paper, we improve the bound for this particular case, showing that the clique-width of series-parallel graphs is smaller or equal to 5.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Graph theory]]></kwd>
<kwd lng="en"><![CDATA[clique-width]]></kwd>
<kwd lng="en"><![CDATA[tree-width]]></kwd>
<kwd lng="en"><![CDATA[complexity]]></kwd>
<kwd lng="en"><![CDATA[series-parallel]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bonomo]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Grippo]]></surname>
<given-names><![CDATA[L. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Milanic]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Safe]]></surname>
<given-names><![CDATA[M. D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Graph classes with and without powers of bounded clique-width]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>2016</year>
<volume>199</volume>
<page-range>3-15</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Corneil]]></surname>
<given-names><![CDATA[D. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Rotics]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
</person-group>
<source><![CDATA[Graph-Theoretic Concepts in Computer Science]]></source>
<year>2001</year>
<conf-name><![CDATA[ 27th InternationalWorkshop, WG 2001]]></conf-name>
<conf-date>June 14&#8211;16, 2001</conf-date>
<conf-loc>Boltenhagen, Germany </conf-loc>
<page-range>78-90</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Courcelle]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Engelfriet]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Rozenberg]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Handle-rewriting hypergraph grammars]]></article-title>
<source><![CDATA[Journal of Computer and System Sciences]]></source>
<year>1993</year>
<volume>46</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>218-70</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Courcelle]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Olariu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Upper bounds to the clique width of graphs]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>2000</year>
<volume>101</volume>
<page-range>77-114</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dabrowski]]></surname>
<given-names><![CDATA[K. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Lozin]]></surname>
<given-names><![CDATA[V. V.]]></given-names>
</name>
<name>
<surname><![CDATA[Paulusma]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Clique-width and well-quasi-ordering of triangle-free graph classes]]></article-title>
<source><![CDATA[Journal of Computer and System Sciences]]></source>
<year>2020</year>
<volume>108</volume>
<page-range>64-91</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dieter]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Graphs, Networks and Algorithms]]></source>
<year>2013</year>
<edition>4</edition>
<publisher-name><![CDATA[Springer Publishing Company, Incorporated]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fellows]]></surname>
<given-names><![CDATA[M. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Rosamond]]></surname>
<given-names><![CDATA[F. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Rotics]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Szeider]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Clique-width is np-complete]]></article-title>
<source><![CDATA[SIAM Journal on Discrete Mathematics]]></source>
<year>2009</year>
<volume>23</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>909-39</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fomin]]></surname>
<given-names><![CDATA[F. V.]]></given-names>
</name>
<name>
<surname><![CDATA[Golovach]]></surname>
<given-names><![CDATA[P. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Lokshtanov]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Saurabh]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Intractability of clique-width parameterizations]]></article-title>
<source><![CDATA[SIAM Journal on Computing]]></source>
<year>2010</year>
<volume>39</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1941-56</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[González-Ruiz]]></surname>
<given-names><![CDATA[J. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Marcial-Romero]]></surname>
<given-names><![CDATA[J. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Hernández]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[De Ita]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Computing the clique-width of polygonal tree graphs]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Pichardo-Lagunas]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Miranda-Jiménez]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Soft Computing]]></source>
<year>2017</year>
<page-range>449-59</page-range><publisher-loc><![CDATA[Cham ]]></publisher-loc>
<publisher-name><![CDATA[Springer International Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[González-Ruiz]]></surname>
<given-names><![CDATA[J. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Marcial-Romero]]></surname>
<given-names><![CDATA[J. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Hernández-Servín]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Computing the clique-width of cactus graphs]]></article-title>
<source><![CDATA[Electronic Notes in Theoretical Computer Science]]></source>
<year>2016</year>
<volume>328</volume>
<page-range>47-57</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gross]]></surname>
<given-names><![CDATA[J. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Yellen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of Graph Theory]]></source>
<year>2013</year>
<edition>2</edition>
<publisher-name><![CDATA[Chapman &amp; Hall/CRC]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Penev]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the clique-width of (4k1,c4,c5,c7)-free graphs]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>2020</year>
<volume>285</volume>
<page-range>688-90</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
