Remarks on Extremal Overfull Graphs - Applied Mathematics

AM > Vol.4 No.8, August 2013

Applied Mathematics

Volume 4, Issue 8 (August 2013)

ISSN Print: 2152-7385 ISSN Online: 2152-7393

Google-based Impact Factor: 0.58 Citations

Remarks on Extremal Overfull Graphs ()

HTML XML

Download as PDF (Size: 64KB) PP. 1106-1108

DOI: 10.4236/am.2013.48149 3,318 Downloads 5,141 Views Citations

Author(s)

Modjtaba Ghorbani

Affiliation(s)

Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training University, Tehran, Iran.

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.

KEYWORDS

Overfull Graph; Edge Chromatic Number; Plannar Graph

Share and Cite:

M. Ghorbani, "Remarks on Extremal Overfull Graphs," Applied Mathematics, Vol. 4 No. 8, 2013, pp. 1106-1108. doi: 10.4236/am.2013.48149.

Cited by