| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652355 | Electronic Notes in Discrete Mathematics | 2009 | 6 Pages |
Abstract
We consider a distance generalisation of the strong chromatic index and the maximum induced matching number, for graphs of bounded maximum degree and Erdős-Rényi random graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
