<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>On the chromatic number of powers of subdivisions of graphs</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Michael</namePart>
  <namePart type="family">Anastos</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">0b2a4358-bb35-11ec-b7b9-e3279b593dbb</identifier></name>
<name type="personal">
  <namePart type="given">Simona</namePart>
  <namePart type="family">Boyadzhiyska</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Silas</namePart>
  <namePart type="family">Rathke</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Juanjo</namePart>
  <namePart type="family">Rué</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">MaKw</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>





<name type="corporate">
  <namePart>IST-BRIDGE: International postdoctoral program</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">For a given graph G=(V,E), we define its \emph{nth subdivision} as the graph obtained from G by replacing every edge by a path of length n. We also define the \emph{mth power} of G as the graph on vertex set V where we connect every pair of vertices at distance at most m in G. In this paper, we study the chromatic number of powers of subdivisions of graphs and resolve the case m=n asymptotically. In particular, our result confirms a conjecture of Mozafari-Nia and Iradmusa in the case m=n=3 in a strong sense.</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2025_DiscreteApplMath_Anastos.pdf">https://research-explorer.ista.ac.at/download/18478/18836/2025_DiscreteApplMath_Anastos.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem><accessCondition type="use and reproduction">https://creativecommons.org/licenses/by/4.0/</accessCondition>
<originInfo><publisher>Elsevier</publisher><dateIssued encoding="w3cdtf">2025</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Discrete Applied Mathematics</title></titleInfo>
  <identifier type="issn">0166-218X</identifier>
  <identifier type="arXiv">2404.05542</identifier>
  <identifier type="ISI">001343647000001</identifier><identifier type="doi">10.1016/j.dam.2024.10.002</identifier>
<part><detail type="volume"><number>360</number></detail><extent unit="pages">506-511</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ieee>M. Anastos, S. Boyadzhiyska, S. Rathke, and J. Rué, “On the chromatic number of powers of subdivisions of graphs,” &lt;i&gt;Discrete Applied Mathematics&lt;/i&gt;, vol. 360. Elsevier, pp. 506–511, 2025.</ieee>
<mla>Anastos, Michael, et al. “On the Chromatic Number of Powers of Subdivisions of Graphs.” &lt;i&gt;Discrete Applied Mathematics&lt;/i&gt;, vol. 360, Elsevier, 2025, pp. 506–11, doi:&lt;a href=&quot;https://doi.org/10.1016/j.dam.2024.10.002&quot;&gt;10.1016/j.dam.2024.10.002&lt;/a&gt;.</mla>
<apa>Anastos, M., Boyadzhiyska, S., Rathke, S., &amp;#38; Rué, J. (2025). On the chromatic number of powers of subdivisions of graphs. &lt;i&gt;Discrete Applied Mathematics&lt;/i&gt;. Elsevier. &lt;a href=&quot;https://doi.org/10.1016/j.dam.2024.10.002&quot;&gt;https://doi.org/10.1016/j.dam.2024.10.002&lt;/a&gt;</apa>
<ama>Anastos M, Boyadzhiyska S, Rathke S, Rué J. On the chromatic number of powers of subdivisions of graphs. &lt;i&gt;Discrete Applied Mathematics&lt;/i&gt;. 2025;360:506-511. doi:&lt;a href=&quot;https://doi.org/10.1016/j.dam.2024.10.002&quot;&gt;10.1016/j.dam.2024.10.002&lt;/a&gt;</ama>
<short>M. Anastos, S. Boyadzhiyska, S. Rathke, J. Rué, Discrete Applied Mathematics 360 (2025) 506–511.</short>
<ista>Anastos M, Boyadzhiyska S, Rathke S, Rué J. 2025. On the chromatic number of powers of subdivisions of graphs. Discrete Applied Mathematics. 360, 506–511.</ista>
<chicago>Anastos, Michael, Simona Boyadzhiyska, Silas Rathke, and Juanjo Rué. “On the Chromatic Number of Powers of Subdivisions of Graphs.” &lt;i&gt;Discrete Applied Mathematics&lt;/i&gt;. Elsevier, 2025. &lt;a href=&quot;https://doi.org/10.1016/j.dam.2024.10.002&quot;&gt;https://doi.org/10.1016/j.dam.2024.10.002&lt;/a&gt;.</chicago>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>18478</recordIdentifier><recordCreationDate encoding="w3cdtf">2024-10-27T23:01:44Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-04-14T07:54:56Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
