CONTRACTIONS AND HAMILTONIAN LINE GRAPHS

被引：20
|
作者：
LAI, HJ
机构：
来源：
JOURNAL OF GRAPH THEORY | 1988年 / 12卷 / 01期
关键词：
D O I：
10.1002/jgt.3190120103
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：11 / 15
页数：5
相关论文
共 50 条
  • [21] Hamiltonian cycles in spanning subgraphs of line graphs
    Li, Hao
    He, Weihua
    Yang, Weihua
    Bai, Yandong
    DISCRETE APPLIED MATHEMATICS, 2016, 209 : 287 - 295
  • [22] On 3-connected hamiltonian line graphs
    Chen, Ye
    Fan, Suohai
    Lai, Hong-Jian
    DISCRETE MATHEMATICS, 2012, 312 (11) : 1877 - 1882
  • [23] Hamiltonian connected hourglass free line graphs
    Li Dengxin
    Lai, Hong-Han
    Shao, Yehong
    Zhan, Mingquan
    DISCRETE MATHEMATICS, 2008, 308 (12) : 2634 - 2636
  • [24] On s-Hamiltonian-Connected Line Graphs
    Ma, Xiaoling
    Lai, Hong-Jian
    Zhan, Mingquan
    Zhang, Taoye
    Zhou, Ju
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2024, 44 (01) : 297 - 315
  • [25] On s-hamiltonian line graphs of claw-free graphs
    Lai, Hong-Jian
    Zhan, Mingquan
    Zhang, Taoye
    Zhou, Ju
    DISCRETE MATHEMATICS, 2019, 342 (11) : 3006 - 3016
  • [26] Hamiltonian connectedness in 3-connected line graphs
    Lai, Hong-Jian
    Shao, Yehong
    Yu, Gexin
    Zhan, Mingquan
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (05) : 982 - 990
  • [27] A related problem on s-Hamiltonian line graphs
    Liu, Xia
    AIMS MATHEMATICS, 2022, 7 (10): : 19553 - 19561
  • [28] Degree sum and hamiltonian-connected line graphs
    Liu, Jianping
    Yu, Aimei
    Wang, Keke
    Lai, Hong-Jian
    DISCRETE MATHEMATICS, 2018, 341 (05) : 1363 - 1379
  • [29] Extending perfect matchings to Hamiltonian cycles in line graphs
    Abreu, Marien
    Gauci, John Baptist
    Labbate, Domenico
    Mazzuoccolo, Giuseppe
    Zerafa, Jean Paul
    ELECTRONIC JOURNAL OF COMBINATORICS, 2021, 28 (01): : 1 - 13
  • [30] Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs
    Chen, ZH
    Lai, HJ
    Li, XW
    Li, DY
    Mao, JZ
    JOURNAL OF GRAPH THEORY, 2003, 42 (04) : 308 - 319
12345