{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:10Z","timestamp":1781463310595,"version":"3.54.1"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T00:00:00Z","timestamp":1778025600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Dutch Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.04.043","type":"journal-article","created":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T13:34:38Z","timestamp":1778592878000},"page":"176-191","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Eigenvalue bounds for distance-edge colourings"],"prefix":"10.1016","volume":"391","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4003-4291","authenticated-orcid":false,"given":"Aida","family":"Abiad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Harper","family":"Reijnders","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"10","key":"10.1016\/j.dam.2026.04.043_b1","doi-asserted-by":"crossref","first-page":"2875","DOI":"10.1016\/j.disc.2019.01.016","article-title":"On the k-independence number of graphs","volume":"342","author":"Abiad","year":"2019","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.dam.2026.04.043_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2021.112706","article-title":"Optimization of eigenvalue bounds for the independence and chromatic number of graph powers","volume":"345","author":"Abiad","year":"2022","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.043_b3","doi-asserted-by":"crossref","unstructured":"A. Abiad, A. Neri, H. Reijnders, Eigenvalue bounds for the distance-t chromatic number of a graph and their application to lee codes, J. Algebra Appl. 24, 2025.","DOI":"10.1142\/S0219498825410245"},{"key":"10.1016\/j.dam.2026.04.043_b4","series-title":"Algebraic Graph Theory","author":"Biggs","year":"1974"},{"key":"10.1016\/j.dam.2026.04.043_b5","unstructured":"A. Brouwer, Parameters of Strongly Regular Graphs. https:\/\/aeb.win.tue.nl\/graphs\/srg\/srgtab.html."},{"key":"10.1016\/j.dam.2026.04.043_b6","series-title":"Distance-Regular Graphs","author":"Brouwer","year":"1989"},{"key":"10.1016\/j.dam.2026.04.043_b7","series-title":"Universitext","doi-asserted-by":"crossref","first-page":"0172","DOI":"10.1007\/978-1-4614-1939-6_1","article-title":"Spectra of graphs","author":"Brouwer","year":"2012"},{"key":"10.1016\/j.dam.2026.04.043_b8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.endm.2015.06.038","article-title":"A stronger bound for the strong chromatic index","volume":"49","author":"Bruhn","year":"2015","journal-title":"Electron. Notes Discrete Math."},{"issue":"2","key":"10.1016\/j.dam.2026.04.043_b9","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1137\/21M1437354","article-title":"Maximizing Line Subgraphs of Diameter at Most t","volume":"36","author":"Cambie","year":"2022","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2026.04.043_b10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.disc.2003.09.009","article-title":"Bounding the strong chromatic index of dense random graphs","volume":"281","author":"Czygrinow","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.043_b11","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1016\/j.disc.2012.12.009","article-title":"Laplacian eigenvalues of the second power of a graph","volume":"313","author":"Das","year":"2013","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2026.04.043_b12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/net.21491","article-title":"Distance edge coloring and collision-free communication in wireless sensor networks","volume":"62","author":"Drira","year":"2013","journal-title":"Networks"},{"key":"10.1016\/j.dam.2026.04.043_b13","first-page":"1","article-title":"SAT Encoding of Partial Ordering Models for Graph Coloring Problems","volume":"vol. 12","author":"Faber","year":"2024"},{"issue":"1","key":"10.1016\/j.dam.2026.04.043_b14","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(89)90163-5","article-title":"Induced matchings in bipartite graphs","volume":"78","author":"Faudree","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.043_b15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.laa.2020.07.009","article-title":"A new class of polynomials from the spectrum of a graph, and its application to bound the k-independence number","volume":"605","author":"Fiol","year":"2020","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.04.043_b16","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1137\/S0895480104445757","article-title":"The strong chromatic index of random graphs","volume":"19","author":"Frieze","year":"2005","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2026.04.043_b17","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.laa.2014.02.016","article-title":"Large regular bipartite graphs with median eigenvalue 1","volume":"449","author":"Guo","year":"2014","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.04.043_b18","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/j.jctb.2025.10.008","article-title":"Cubic graphs with no eigenvalues in the interval (-1,1)","volume":"176","author":"Guo","year":"2026","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"10.1016\/j.dam.2026.04.043_b19","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-Completeness of Edge-Coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2026.04.043_b20","series-title":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)Proceedings","first-page":"135","article-title":"An improved procedure for colouring graphs of bounded local density","author":"Hurley","year":"2021"},{"key":"10.1016\/j.dam.2026.04.043_b21","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/j.jda.2006.03.020","article-title":"Algorithms for finding distance-edge-colorings of graphs","volume":"5","author":"Ito","year":"2007","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"10.1016\/j.dam.2026.04.043_b22","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1017\/S0963548313000473","article-title":"The Distance-t Chromatic Index of Graphs","volume":"23","author":"Kaiser","year":"2014","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.dam.2026.04.043_b23","article-title":"The Erd\u0151s-Ne\u0161et\u0159il Conjecture","author":"Kang","year":"2024","journal-title":"Talk Netw. Train. Week"},{"issue":"16\u201317","key":"10.1016\/j.dam.2026.04.043_b24","doi-asserted-by":"crossref","first-page":"2435","DOI":"10.1016\/j.dam.2012.07.001","article-title":"Distance edge-colourings and matchings","volume":"160","author":"Kang","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.04.043_b25","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1016\/j.endm.2017.07.025","article-title":"Distance colouring without one cycle length","volume":"61","author":"Kang","year":"2017","journal-title":"Electron. Notes Discrete Math."},{"issue":"7","key":"10.1016\/j.dam.2026.04.043_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113471","article-title":"The optimal bound on the 3-independence number obtainable from a polynomial-type method","volume":"346","author":"Kavi","year":"2023","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2026.04.043_b27","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","article-title":"NP completeness of finding the chromatic index of regular graphs","volume":"4","author":"Leven","year":"1983","journal-title":"J. Algorithms"},{"issue":"3\u20134","key":"10.1016\/j.dam.2026.04.043_b28","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<357::AID-RSA9>3.0.CO;2-Y","article-title":"The strong chromatic index of c4-free graphs","volume":"17","author":"Mahdian","year":"2000","journal-title":"Random Structures Algorithms"},{"issue":"2","key":"10.1016\/j.dam.2026.04.043_b29","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1006\/jctb.1997.1724","article-title":"A Bound on the Strong Chromatic Index of a Graph","volume":"69","author":"Molloy","year":"1997","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.04.043_b30","first-page":"219","article-title":"The strong edge colorings of a sparse random graph","volume":"18","author":"Palka","year":"1998","journal-title":"Australas. J. Comb."},{"issue":"1","key":"10.1016\/j.dam.2026.04.043_b31","doi-asserted-by":"crossref","first-page":"89","DOI":"10.7151\/dmgt.1010","article-title":"Some maximum multigraphs and edge\/vertex distance colourings","volume":"15","author":"Skupie\u0144","year":"1995","journal-title":"Discuss. Math. Graph Theory"},{"issue":"7","key":"10.1016\/j.dam.2026.04.043_b32","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1016\/j.disc.2006.04.033","article-title":"BCH codes and distance multi- or fractional colorings in hypercubes asymptotically","volume":"307","author":"Skupie\u0144","year":"2007","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.043_b33","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1017\/S0963548301004898","article-title":"A general upper bound on the list chromatic number of locally sparse graphs","volume":"11","author":"Vu","year":"2002","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.dam.2026.04.043_b34","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.ipl.2017.09.007","article-title":"Strong chromatic index of K4-minor free graphs","volume":"129","author":"Wang","year":"2018","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/j.dam.2026.04.043_b35","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1112\/jlms\/s1-42.1.330","article-title":"The Eigenvalues of a Graph and Its Chromatic Number","volume":"s1-42","author":"Wilf","year":"1967","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.dam.2026.04.043_b36","series-title":"An Optimization Approach to Algebraic Graph Theory","author":"Zeijlemaker","year":"2024"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002714?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002714?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:08:24Z","timestamp":1781460504000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":36,"alternative-id":["S0166218X26002714"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.043","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Eigenvalue bounds for distance-edge colourings","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.043","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}