On strong edge-coloring of graphs with maximum degree 5
- 16 November 2023
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 344, 120-128
Abstract
No abstract availableKeywords
Funding Information
- NSFC
This publication has 15 references indexed in Scilit:
- Recent progress on strong edge-coloring of graphsDiscrete Mathematics, Algorithms and Applications, 2019
- On strong edge-coloring of graphs with maximum degree 4Discrete Applied Mathematics, 2018
- A stronger bound for the strong chromatic indexElectronic Notes in Discrete Mathematics, 2015
- Strong edge-coloring of graphs with maximum degree 4 using 22 colorsDiscrete Mathematics, 2006
- Combinatorial NullstellensatzCombinatorics, Probability and Computing, 1999
- A Bound on the Strong Chromatic Index of a GraphJournal of Combinatorial Theory, Series B, 1997
- Induced matchings in cubic graphsJournal of Graph Theory, 1993
- The strong chromatic index of a cubic graph is at most 10Discrete Mathematics, 1992
- Problems and results in combinatorial analysis and graph theoryDiscrete Mathematics, 1988
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935