On total colorings of 1-planar graphs - Details

author：

Zhang, X. (Zhang, X..) ^[1] | Hou, J. (Hou, J..) ^[2] | Liu, G. (Liu, G..) ^[3]

Indexed by：

Scopus

Abstract：

A　graph　is　$$1$$1-planar　if　it　can　be　drawn　on　the　plane　so　that　each　edge　is　crossed　by　at　most　one　other　edge.　In　this　paper,　we　confirm　the　total-coloring　conjecture　for　1-planar　graphs　with　maximum　degree　at　least　13.　©　2013,　Springer　Science+Business　Media　New　York.

Keyword：

1-Planar graph; Discharging method; Total coloring

Community：

[ 1 ] [Zhang, X.]Department of Mathematics, Xidian University, Xi’an, 710071, China
[ 2 ] [Hou, J.]Center for Discrete Mathematics, Fuzhou University, Fuzhou, 350002, China
[ 3 ] [Liu, G.]School of Mathematics, Shandong University, Jinan, 250100, China

Reprint 's Address：

[Zhang, X.]Department of Mathematics, Xidian UniversityChina

Email：

Show more details

Related Keywords：

Source ：

Journal of Combinatorial Optimization

ISSN： 1382-6905

Year： 2015

Issue： 1

Volume： 30

Page： 160-173

1 . 0 8

JCR@2015

0 . 9 0 0

JCR@2023

ESI HC Threshold：86

JCR Journal Grade：2

CAS Journal Grade：3

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count： 16

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 3

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to