---
res:
  bibo_abstract:
  - 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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Michael
      foaf_name: Anastos, Michael
      foaf_surname: Anastos
      foaf_workInfoHomepage: http://www.librecat.org/personId=0b2a4358-bb35-11ec-b7b9-e3279b593dbb
  - foaf_Person:
      foaf_givenName: Simona
      foaf_name: Boyadzhiyska, Simona
      foaf_surname: Boyadzhiyska
  - foaf_Person:
      foaf_givenName: Silas
      foaf_name: Rathke, Silas
      foaf_surname: Rathke
  - foaf_Person:
      foaf_givenName: Juanjo
      foaf_name: Rué, Juanjo
      foaf_surname: Rué
  bibo_doi: 10.1016/j.dam.2024.10.002
  bibo_volume: 360
  dct_date: 2025^xs_gYear
  dct_identifier:
  - UT:001343647000001
  dct_isPartOf:
  - http://id.crossref.org/issn/0166-218X
  dct_language: eng
  dct_publisher: Elsevier@
  dct_title: On the chromatic number of powers of subdivisions of graphs@
...