Hamiltonicity and forbidden subgraphs in 4-connected graphs

被引：12

作者：

Pfender, F ^{[1
]}

机构：

[1] Tech Univ Berlin, Fachbereich Math, D-10623 Berlin, Germany

来源：

JOURNAL OF GRAPH THEORY | 2005年 / 49卷 / 04期

关键词：

Hamilton cycle; claw-free graphs; forbidden subgraphs;

D O I：

10.1002/jgt.20080

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let T be the line graph of the unique tree F on 8 vertices with degree sequence (3, 3 3, 1 1, 1, 1 1), i.e., T is a chain of three triangles. We show that every 4-connected {T, K-1,K-3}-free graph has a hamiltonian cycle. (C) 2005 Wiley Periodicals, Inc.

引用

页码：262 / 272

页数：11

共 11 条

[1] Bollob┬u├s B., 2013, MODERN GRAPH THEORY, V184
[2] Strengthening the closure concept in claw-free graphs
Broersma, H
Ryjácek, Z
[J]. DISCRETE MATHEMATICS, 2001, 233 (1-3) : 55 - 63
[3] On factors of 4-connected claw-free graphs
Broersma, HJ
Kriesell, M
Ryjácek, Z
[J]. JOURNAL OF GRAPH THEORY, 2001, 37 (02) : 125 - 136
[4] Brousek J, 1999, DISCRETE MATH, V197, P143
[5] A REDUCTION METHOD TO FIND SPANNING EULERIAN SUBGRAPHS
CATLIN, PA
[J]. JOURNAL OF GRAPH THEORY, 1988, 12 (01) : 29 - 44
[6] Harary F., 1965, CANAD MATH B, V8, P701, DOI DOI 10.4153/CMB-1965-051-3
[7] KAISER T, IN PRESS J GRAPH THE
[8] GRAPH WHOSE EDGES ARE IN SMALL CYCLES
LAI, HJ
[J]. DISCRETE MATHEMATICS, 1991, 94 (01) : 11 - 22
[9] HAMILTONIAN RESULTS IN K1,3 FREE GRAPHS
MATTHEWS, MM
SUMNER, DP
[J]. JOURNAL OF GRAPH THEORY, 1984, 8 (01) : 139 - 146
[10] On a closure concept in claw-free graphs
Ryjacek, Z
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1997, 70 (02) : 217 - 224

← 1 2 →