3-Connected {K1,3, P9}-Free Graphs are Hamiltonian-Connected

被引：0
|
作者：
Qiuju Bian
Ronald J. Gould
Paul Horn
Susan Janiszewski
Steven La Fleur
Paul Wrayno
机构：
[1] Shandong University of Technology,School of Mathematics and Information Science
[2] Emory University,Department of Mathematics and Computer Science
[3] Harvard University,Department of Mathematics, FAS
[4] Western Kentucky University,Department of Mathematics
来源：
Graphs and Combinatorics | 2014年 / 30卷
关键词：
Hamilton-connected; 3-Connected; Claw-free; Dominating; Closure;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We investigate pairs of forbidden subgraphs that imply a 3-connected graph is Hamiltonian-connected. In particular we show that the pair {K1,3, P9} is such a pair. As it is known that P10 cannot replace P9, this result is best possible. Further, we show that certain other graphs are not possible.
引用
收藏
页码：1099 / 1122
页数：23
相关论文
共 50 条
  • [1] 3-Connected {K 1,3, P 9}-Free Graphs are Hamiltonian-Connected
    Bian, Qiuju
    Gould, Ronald J.
    Horn, Paul
    Janiszewski, Susan
    La Fleur, Steven
    Wrayno, Paul
    [J]. GRAPHS AND COMBINATORICS, 2014, 30 (05) : 1099 - 1122
  • [2] Longest Cycles in 3-Connected, K1,3-Free Graphs
    李明楚
    [J]. 数学进展, 1989, (01) : 119 - 119
  • [3] Every 3-connected {K1,3,N3,3,3}-free graph is Hamiltonian
    HouYuan Lin
    ZhiQuan Hu
    [J]. Science China Mathematics, 2013, 56 : 1585 - 1595
  • [4] Every 3-connected {K1,3,N3,3,3}-free graph is Hamiltonian
    LIN HouYuan
    HU ZhiQuan
    [J]. Science China Mathematics, 2013, 56 (08) : 1588 - 1598
  • [5] Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected
    Vrana, Petr
    Zhan, Xingzhi
    Zhang, Leilei
    [J]. DISCRETE MATHEMATICS, 2022, 345 (08)
  • [6] On 3-connected hamiltonian line graphs
    Chen, Ye
    Fan, Suohai
    Lai, Hong-Jian
    [J]. DISCRETE MATHEMATICS, 2012, 312 (11) : 1877 - 1882
  • [7] Claw-free 3-connected P11-free graphs are Hamiltonian
    Luczak, T
    Pfender, F
    [J]. JOURNAL OF GRAPH THEORY, 2004, 47 (02) : 111 - 121
  • [8] Hamiltonian cycles in 3-connected Claw-free graphs
    Li, GJ
    Lu, M
    Liu, Z
    [J]. DISCRETE MATHEMATICS, 2002, 250 (1-3) : 137 - 151
  • [9] HAMILTONIAN CYCLES IN 3-CONNECTED CLAW-FREE GRAPHS
    LI, MC
    [J]. JOURNAL OF GRAPH THEORY, 1993, 17 (03) : 303 - 313
  • [10] Hamiltonian Cycles in 3-connected Claw-Free Graphs
    李明楚
    [J]. 数学进展, 1991, (03) : 380 - 381
12345