Light paths in 4-connected graphs in the plane and other surfaces

被引：0
|
作者：
Mohar, B.
机构：
来源：
Journal of Graph Theory | 2001年 / 34卷 / 02期
关键词：
D O I：
10.1002/1097-0118(200006)34:23.0.CO;2-P
中图分类号：
学科分类号：
摘要：
19
引用
收藏
页码：170 / 179
相关论文
共 50 条
  • [41] Long cycles in 4-connected planar graphs
    Cui, Qing
    Hu, Yumei
    Wang, Jian
    DISCRETE MATHEMATICS, 2009, 309 (05) : 1051 - 1059
  • [42] On 4-connected graphs without even cycle decompositions
    Rizzi, R
    DISCRETE MATHEMATICS, 2001, 234 (1-3) : 181 - 186
  • [43] 4-connected maximal planar graphs are 4-ordered
    Goddard, W
    DISCRETE MATHEMATICS, 2002, 257 (2-3) : 405 - 410
  • [44] Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
    Kant, G
    He, X
    THEORETICAL COMPUTER SCIENCE, 1997, 172 (1-2) : 175 - 193
  • [45] On the number of 4-contractible edges in 4-connected graphs
    Ando, K.
    Egawa, Y.
    Kawarabayashi, K.
    Kriesell, Matthias
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2009, 99 (01) : 97 - 109
  • [46] On factors of 4-connected claw-free graphs
    Broersma, HJ
    Kriesell, M
    Ryjácek, Z
    JOURNAL OF GRAPH THEORY, 2001, 37 (02) : 125 - 136
  • [47] Degree sum conditions for the circumference of 4-connected graphs
    Chiba, Shuya
    Tsugaki, Masao
    Yamashita, Tomoki
    DISCRETE MATHEMATICS, 2014, 333 : 66 - 83
  • [48] Chain decompositions and independent trees in 4-connected graphs
    Curran, S
    Lee, O
    Yu, XX
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 186 - 191
  • [49] 4-connected projective-planar graphs are hamiltonian-connected
    Kawarabayashi, Ken-ichi
    Ozeki, Kenta
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 378 - 395
  • [50] 4-connected projective-planar graphs are Hamiltonian-connected
    Kawarabayashi, Ken-ichi
    Ozeki, Kenta
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 112 : 36 - 69
12345