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. W...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.展开更多
文摘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.
