Toggle navigation
OpenReview
.net
Login
×
Go to
ENDM 2009
homepage
On distance edge-colourings and matchings
Ross J. Kang
,
Putra Manggala
2009 (modified: 14 Sept 2021)
Electron. Notes Discret. Math. 2009
Readers:
Everyone
Abstract:
We consider a distance generalisation of the strong chromatic index and the maximum induced matching number, for graphs of bounded maximum degree and …
0 Replies
Loading