[This article was originally published online on 5 May 2012. In December 2012, a deficiency in the proof of Theorem 1 was acknowledged and corrected (see Acknowledgements)]. The corrected version was published on 20 February 2013.
Strong Chromatic Index of 2-Degenerate Graphs
Article first published online: 14 MAY 2012
© 2012 Wiley Periodicals, Inc.
Journal of Graph Theory
Volume 73, Issue 2, pages 119–126, June 2013
How to Cite
Chang, G. J. and Narayanan, N. (2013), Strong Chromatic Index of 2-Degenerate Graphs. J. Graph Theory, 73: 119–126. doi: 10.1002/jgt.21646
Contract grant sponsor: National Science Council, Contract grant numbers: NSC98-2115-M-002-013-MY3 and NSC099-2811-M-002-042.
- Issue published online: 1 APR 2013
- Article first published online: 14 MAY 2012
- Manuscript Accepted: 5 JAN 2012
- Manuscript Revised: 24 DEC 2011
- Manuscript Received: 28 OCT 2010
- National Science Council. Grant Numbers: NSC98-2115-M-002-013-MY3, NSC099-2811-M-002-042
- strong chromatic index;
- induced matching;
- 2-degenerate graph;
- edge coloring;
- block line critical graph;
- chordless graph
We prove that the strong chromatic index of a 2-degenerate graph is linear in the maximum degree Δ. This includes the class of all chordless graphs (graphs in which every cycle is induced) which in turn includes graphs where the cycle lengths are multiples of four, and settles a problem by Faudree et al. (Ars Combin 29(B) (1990), 205–211). © 2012 Wiley Periodicals, Inc. J. Graph Theory 73: 119–126, 2013