Choosability of planar graphs

被引：0
|
作者：
Institut für Mathematik, TU Ilmenau, 98684 Ilmenau, Germany [1 ]
机构：
来源：
Discrete Math | / 1-3卷 / 457-460期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Choosability of planar graphs
    Voigt, M
    [J]. DISCRETE MATHEMATICS, 1996, 150 (1-3) : 457 - 460
  • [2] Choosability in signed planar graphs
    Jin, Ligang
    Kang, Yingli
    Steffen, Eckhard
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2016, 52 : 234 - 243
  • [3] Minimum choosability of planar graphs
    Huijuan Wang
    Bin Liu
    Ling Gai
    Hongwei Du
    Jianliang Wu
    [J]. Journal of Combinatorial Optimization, 2018, 36 : 13 - 22
  • [4] Path Choosability of Planar Graphs
    Chappell, Glenn G.
    Hartman, Chris
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (04):
  • [5] Minimum choosability of planar graphs
    Wang, Huijuan
    Liu, Bin
    Gai, Ling
    Du, Hongwei
    Wu, Jianliang
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 36 (01) : 13 - 22
  • [6] A note on adaptable choosability and choosability with separation of planar graphs
    Casselgren, Carl Johan
    Granholmt, Jonas B.
    Raspaud, André
    [J]. Journal of Combinatorial Mathematics and Combinatorial Computing, 2021, 116 : 101 - 109
  • [7] On the total choosability of planar graphs and of sparse graphs
    Chang, Gerard Jennhwa
    Hou, Jianfeng
    Roussel, Nicolas
    [J]. INFORMATION PROCESSING LETTERS, 2010, 110 (20) : 849 - 853
  • [8] Choosability and edge choosability of planar graphs without intersecting triangles
    Wang, WF
    Lih, KW
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2002, 15 (04) : 538 - 545
  • [9] A note on choosability with separation for planar graphs
    Skrekovski, R
    [J]. ARS COMBINATORIA, 2001, 58 : 169 - 174
  • [10] Choosability and edge choosability of planar graphs without five cycles
    Wang, WF
    Lih, KW
    [J]. APPLIED MATHEMATICS LETTERS, 2002, 15 (05) : 561 - 565
12345