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 条

[41] Properly 3-contractible edges in a minimally 3-connected graph
Ando, Kiyoshi
Egawa, Yoshimi
[J]. DISCRETE MATHEMATICS, 2023, 346 (05)
[42] Every 3-connected {K1,3,N1,2,3}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{K_{1,3},N_{1,2,3}\}$$\end{document}-free graph is Hamilton-connected
Zhiquan Hu
Shunzhe Zhang
[J]. Graphs and Combinatorics, 2016, 32 (2) : 685 - 705
[43] A remark on the connectivity of the complement of a 3-connected graph
Ando, K
Kaneko, A
[J]. DISCRETE MATHEMATICS, 1996, 151 (1-3) : 39 - 47
[44] LARGE CONTRACTIBLE SUBGRAPHS OF A 3-CONNECTED GRAPH
Karpov, Dmitri, V
[J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021, 41 (01) : 83 - 101
[45] [2,3]-factors in a 3-connected infinite planar graph
Jung H.-O.
[J]. Journal of Applied Mathematics and Computing, 2002, 10 (1-2) : 27 - 40
[46] Claw-free 3-connected P11-free graphs are Hamiltonian
Luczak, T
Pfender, F
[J]. JOURNAL OF GRAPH THEORY, 2004, 47 (02) : 111 - 121
[47] On the hamiltonian property hierarchy of 3-connected planar graphs
Lo, On-Hei Solomon
[J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2022, 29 (04):
[48] Spanning trees in 3-connected K3,t-minor-free graphs
Ota, Katsuhiro
Ozeki, Kenta
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2012, 102 (05) : 1179 - 1188
[49] LONG CYCLES AND 3-CONNECTED SPANNING SUBGRAPHS OF BOUNDED DEGREE IN 3-CONNECTED K-1,D-FREE GRAPHS
JACKSON, B
WORMALD, NC
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1995, 63 (02) : 163 - 169
[50] The 3/5-conjecture for weakly S(K1,3)-free forests
Schmidt, Simon
[J]. DISCRETE MATHEMATICS, 2016, 339 (11) : 2767 - 2774

← 1 2 3 4 5 →