Every 3-connected {K1,3,N3,3,3}-free graph is Hamiltonian

被引：0

作者：

LIN HouYuan ^{[1
,2
]}

HU ZhiQuan ^{[2
]}

机构：

[1] School of Mathematics and Quantitative Economics,Shandong University of Finance and Economics

[2] Faculty of Mathematics and Statistics,Central China Normal University

来源：

Science China Mathematics | 2013年 / 56卷 / 08期

基金：

中国国家自然科学基金;

关键词：

Hamiltonian graphs; forbidden subgraphs; claw-free graphs; closure;

D O I：

暂无

中图分类号：

O157.5 [图论];

学科分类号：

070104 ;

摘要：

For non-negative integers i,j and k,let N i,j,k be the graph obtained by identifying end vertices of three disjoint paths of lengths i,j and k to the vertices of a triangle.In this paper,we prove that every 3-connected {K1,3,N3,3,3 }-free graph is Hamiltonian.This result is sharp in the sense that for any integer i>3,there exist infinitely many 3-connected {K1,3,Ni,3,3 }-free non-Hamiltonian graphs.

引用

页码：1588 / 1598

页数：11

共 50 条

[1] Every 3-connected {K1,3,N3,3,3}-free graph is Hamiltonian
HouYuan Lin
ZhiQuan Hu
[J]. Science China Mathematics, 2013, 56 : 1585 - 1595
[2] Every 3-connected {K 1,3,N 3,3,3}-free graph is Hamiltonian
Lin HouYuan
Hu ZhiQuan
[J]. SCIENCE CHINA-MATHEMATICS, 2013, 56 (08) : 1585 - 1595
[3] Every 3-connected {K1,3, N1,2,3}-free graph is Hamilton-connected
Hu, Zhiquan
Zhang, Shunzhe
[J]. GRAPHS AND COMBINATORICS, 2016, 32 (02) : 685 - 705
[4] 3-Connected {K1,3, P9}-Free Graphs are Hamiltonian-Connected
Qiuju Bian
Ronald J. Gould
Paul Horn
Susan Janiszewski
Steven La Fleur
Paul Wrayno
[J]. Graphs and Combinatorics, 2014, 30 : 1099 - 1122
[5] Every 3-connected {K1,3, Z7}-free graph of order at least 21 is Hamilton-connected
Ryjacek, Zdenek
Vrana, Petr
[J]. DISCRETE MATHEMATICS, 2021, 344 (06)
[6] 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)
[7] 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
[8] Longest Cycles in 3-Connected, K1,3-Free Graphs
李明楚
[J]. 数学进展, 1989, (01) : 119 - 119
[9] Every 3-Connected Claw-Free Z8-Free Graph Is Hamiltonian
Lai, Hong-Jian
Xiong, Liming
Yan, Huiya
Yan, Jin
[J]. JOURNAL OF GRAPH THEORY, 2010, 64 (01) : 1 - 11
[10] Every 3-connected, essentially 11-connected line graph is Hamiltonian
Lai, HH
Shao, YH
Wu, HH
Zhou, J
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2006, 96 (04) : 571 - 576

← 1 2 3 4 5 →