List total coloring of pseudo-outerplanar graphs

被引：11
|
作者：
Zhang, Xin [1 ]
机构：
[1] Xidian Univ, Dept Math, Xian 710071, Peoples R China
来源：
DISCRETE MATHEMATICS | 2013年 / 313卷 / 20期
基金：
中国国家自然科学基金;
关键词：
Pseudo-outerplanar graph; List total coloring; Structures; PLANAR GRAPHS; EDGE;
D O I：
10.1016/j.disc.2013.06.007
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. It is proved that every pseudo-outerplanar graph with maximum degree Delta >= 5 is totally (Delta + 1)-choosable. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码：2297 / 2306
页数：10
相关论文
共 50 条
12345