TITLE:
Remarks on Extremal Overfull Graphs
AUTHORS:
Modjtaba Ghorbani
KEYWORDS:
Overfull Graph; Edge Chromatic Number; Plannar Graph
JOURNAL NAME:
Applied Mathematics,
Vol.4 No.8,
July
23,
2013
ABSTRACT:
An overfull graph is a graph whose number of its edges is greater than the product of its maximum degree and[n/2] , where n is the number of vertices. In this paper, some extremals of overfull graphs are presented. We also classify all plannar overfull graphs.