• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
成果搜索

author:

Zhang, Xin (Zhang, Xin.) [1] | Hou, Jianfeng (Hou, Jianfeng.) [2] | Liu, Guizhen (Liu, Guizhen.) [3]

Indexed by:

EI

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:

Coloring Combinatorial mathematics Mathematical techniques

Community:

  • [ 1 ] [Zhang, Xin]Department of Mathematics, Xidian University, Xi’an; 710071, China
  • [ 2 ] [Hou, Jianfeng]Center for Discrete Mathematics, Fuzhou University, Fuzhou; 350002, China
  • [ 3 ] [Liu, Guizhen]School of Mathematics, Shandong University, Jinan; 250100, China

Reprint 's Address:

  • [zhang, xin]department of mathematics, xidian university, xi’an; 710071, china

Email:

Show more details

Related Keywords:

Related Article:

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: 5

Affiliated Colleges:

Online/Total:121/10007558
Address:FZU Library(No.2 Xuyuan Road, Fuzhou, Fujian, PRC Post Code:350116) Contact Us:0591-22865326
Copyright:FZU Library Technical Support:Beijing Aegean Software Co., Ltd. 闽ICP备05005463号-1