Strong edge colorings of graphs and the covers of Kneser graphs
- 30 January 2022
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 100 (4) , 686-697
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- The Slovenian Research and Innovation Agency
- Agentúra na Podporu Výskumu a Vývoja
- Vedecká Grantová Agentúra MŠVVaŠ SR a SAV
This publication has 15 references indexed in Scilit:
- Precise upper bound for the strong edge chromatic number of sparse planar graphsDiscussiones Mathematicae Graph Theory, 2013
- The strong chromatic index of a class of graphsDiscrete Mathematics, 2008
- The incidence coloring conjecture for graphs of maximum degree 3Discrete Mathematics, 2005
- On induced matchingsDiscrete Mathematics, 1993
- 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
- A contribution to the theory of voltage graphsDiscrete Mathematics, 1986
- Homological Coverings of GraphsJournal of the London Mathematical Society, 1984
- SOME ODD GRAPH THEORYAnnals of the New York Academy of Sciences, 1979