Referenced Items are not available for this document.
Let G be a planar graph with maximum degree Δ≥7 and without 3-cycles adjacent to 4-cycles, that is, any 3-cycle has not a common edge with a 4-cycle. Then the total chromatic number of G is (Δ+1).
Published in:
Internet Technology and Applications (iTAP), 2011 International Conference on
Date of Conference: 16-18 Aug. 2011
- Page(s):
- 1 - 4
- Print ISBN:
- 978-1-4244-7253-6
- INSPEC Accession Number:
- 12215874
- Conference Location :
- Wuhan
- Digital Object Identifier :
- 10.1109/ITAP.2011.6006204
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
