Skip Navigation

Journal of the London Mathematical Society 1995 52(3):434-446; doi:10.1112/jlms/52.3.434
© 1995 by London Mathematical Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Yap, H. P.
Right arrow Articles by Fu, H. L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The London Mathematical Society

Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n – 1

H. P. Yap, B. L. Chen and H. L. Fu

Department of Mathematics, National University of Singapore 10 Kent Ridge Crescent, Singapore 0511
Institute of Mathematics, Academia Sinica Nankang, Taipei 11529, Taiwan, Republic of China
Department of Applied Mathematics, National Chiao Tung University 1001 Ta Hsueh Road, Hsinchu, Taiwan, Republic of China

Received 19 March 1992. Revision received 14 August 1993.

Let G be a graph of order 2n + l having maximum degree 2n – 1. We prove that the total chromatic number of G is 2n if and only if eFormula + {alpha}'Formula ≥ n, where w is a vertex of minimum degree in G, Formula is the complement of G — w, eFormula is the size of Formula, and {alpha}'Formula is the edge independence number of Formula.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.