Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree

Authors

T. Niessen, L. Volkmann,

Abstract

        A graph G is called Class 1 if the chromatic index equals the maximum degree. Strong sufficient conditions for simple graphs to be Class 1 are proved.

BibTEX Reference Entry 

@article{NiVo90,
	author = {Thomas Niessen and Lutz Volkmann},
	title = "Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree",
	journal = "J. Graph Theory",
	year = 1990,
	}

Downloads

 Download bibtex-file

Sorry, this paper is currently not available for download.