Choosability in signed planar graphs

被引：14
|
作者：
Jin, Ligang [1 ]
Kang, Yingli [1 ,2 ]
Steffen, Eckhard [1 ]
机构：
[1] Univ Paderborn, Paderborn Inst Adv Studies Comp Sci & Engn, D-33098 Paderborn, Germany
[2] Int Grad Sch Dynam Intelligent Syst, Paderborn, Germany
来源：
EUROPEAN JOURNAL OF COMBINATORICS | 2016年 / 52卷
关键词：
CYCLES;
D O I：
10.1016/j.ejc.2015.10.001
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
This paper studies the choosability of signed planar graphs. We prove that every signed planar graph is 5-choosable and that there is a signed planar graph which is not 4-choosable while the unsigned graph is 4-choosable. For each k is an element of {3, 4, 5, 6}, every signed planar graph without circuits of length k is 4-choosable. Furthermore, every signed planar graph without circuits of length 3 and of length 4 is 3-choosable. We construct a signed planar graph with girth 4 which is not 3-choosable but the unsigned graph is 3-choosable. (C) 2015 Elsevier Ltd. All rights reserved.
引用
下载
收藏
页码：234 / 243
页数：10
相关论文
共 50 条
  • [31] Choosability of the square of planar subcubic graphs with large girth
    Havet, F.
    DISCRETE MATHEMATICS, 2009, 309 (11) : 3553 - 3563
  • [32] On choosability with separation of planar graphs with lists of different sizes
    Kierstead, H. A.
    Lidicky, Bernard
    DISCRETE MATHEMATICS, 2015, 338 (10) : 1779 - 1783
  • [33] Edge choosability of planar graphs without short cycles
    WANG Weifan School of Mathematics and Physics
    Science China Mathematics, 2005, (11) : 1531 - 1544
  • [34] Edge choosability of planar graphs without short cycles
    WANG Weifan School of Mathematics and Physics Zhejiang Normal University Jinhua China
    ScienceinChina,SerA., 2005, Ser.A.2005 (11) : 1531 - 1544
  • [35] Neighbor sum distinguishing total choosability of planar graphs
    Cunquan Qu
    Guanghui Wang
    Guiying Yan
    Xiaowei Yu
    Journal of Combinatorial Optimization, 2016, 32 : 906 - 916
  • [36] Adaptable choosability of planar graphs with sparse short cycles
    Guan, Albert
    Zhu, Xuding
    DISCRETE MATHEMATICS, 2009, 309 (20) : 6044 - 6047
  • [37] Edge choosability of planar graphs without short cycles
    Weifan Wang
    Science in China Series A: Mathematics, 2005, 48 : 1531 - 1544
  • [38] Injective choosability of subcubic planar graphs with girth 6
    Brimkov, Boris
    Edmond, Jennifer
    Lazar, Robert
    Lidicky, Bernard
    Messerschmidt, Kacy
    Walker, Shanise
    DISCRETE MATHEMATICS, 2017, 340 (10) : 2538 - 2549
  • [39] Separating signatures in signed planar graphs
    Naserasr, Reza
    Yu, Weiqiang
    DISCRETE APPLIED MATHEMATICS, 2023, 338 : 302 - 310
  • [40] THE PROJECTIVE-PLANAR SIGNED GRAPHS
    ZASLAVSKY, T
    DISCRETE MATHEMATICS, 1993, 113 (1-3) : 223 - 247
12345