Eigenvalue bounds for distance-edge colourings
Authors:
- Aida AbiadAAAida Abiad
- Harper ReijndersHRHarper Reijnders
Open Access
- 12 May 2026
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 391, 176-191
Abstract
No abstract availableAll Related Versions
Funding Information
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek (OCENW.KLEIN.475)
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek (VI.Vidi.213.085)
This publication has 28 references indexed in Scilit:
- Laplacian eigenvalues of the second power of a graphDiscrete Mathematics, 2013
- Distance edge coloring and collision-free communication in wireless sensor networksNetworks, 2013
- Distance edge-colourings and matchingsDiscrete Applied Mathematics, 2012
- Graph Spectrum2011
- BCH codes and distance multi- or fractional colorings in hypercubes asymptoticallyDiscrete Mathematics, 2007
- Bounding the strong chromatic index of dense random graphsDiscrete Mathematics, 2004
- The strong chromatic index ofC4-free graphsRandom Structures & Algorithms, 2000
- A Bound on the Strong Chromatic Index of a GraphJournal of Combinatorial Theory, Series B, 1997
- Induced matchings in bipartite graphsDiscrete Mathematics, 1989
- NP completeness of finding the chromatic index of regular graphsJournal of Algorithms, 1983