Hamiltonian cycles in n-factor-critical graphs

Ken Ichi Kawarabayashi, Katsuhiro Ota, Akira Saito

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

A graph G is said to be n-factor-critical if G - S has a 1-factor for any S ⊂ V(G) with |S| = n. In this paper, we prove that if G is a 2-connected n-factor-critical graph of order p with σ33/2(G)≥(p - n - 1), then G is hamiltonian with some exceptions. To extend this theorem, we define a (k,n)-factor-critical graph to be a graph G such that G - S has a k-factor for any S ⊂ V(G) with |S| = n. We conjecture that if G is a 2-connected (k,n)-factor-critical graph of order p with σ3(G)≥3/2(p - n - k), then G is hamiltonian with some exceptions. In this paper, we characterize all such graphs that satisfy the assumption, but are not 1-tough. Using this, we verify the conjecture for k≤2.

Original languageEnglish
Pages (from-to)71-82
Number of pages12
JournalDiscrete Mathematics
Volume240
Issue number1-3
DOIs
Publication statusPublished - 2001 Sep 28

Fingerprint

Factor Graph
Hamiltonians
Critical Graph
Hamiltonian circuit
Exception
Graph in graph theory
Verify
Theorem

Keywords

  • Degree sum
  • Factor-critical graphs
  • Hamiltonian cycle
  • Toughness

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Hamiltonian cycles in n-factor-critical graphs. / Kawarabayashi, Ken Ichi; Ota, Katsuhiro; Saito, Akira.

In: Discrete Mathematics, Vol. 240, No. 1-3, 28.09.2001, p. 71-82.

Research output: Contribution to journalArticle

Kawarabayashi, Ken Ichi ; Ota, Katsuhiro ; Saito, Akira. / Hamiltonian cycles in n-factor-critical graphs. In: Discrete Mathematics. 2001 ; Vol. 240, No. 1-3. pp. 71-82.
@article{43f3688f21214d7fb2e58126b94e3258,
title = "Hamiltonian cycles in n-factor-critical graphs",
abstract = "A graph G is said to be n-factor-critical if G - S has a 1-factor for any S ⊂ V(G) with |S| = n. In this paper, we prove that if G is a 2-connected n-factor-critical graph of order p with σ33/2(G)≥(p - n - 1), then G is hamiltonian with some exceptions. To extend this theorem, we define a (k,n)-factor-critical graph to be a graph G such that G - S has a k-factor for any S ⊂ V(G) with |S| = n. We conjecture that if G is a 2-connected (k,n)-factor-critical graph of order p with σ3(G)≥3/2(p - n - k), then G is hamiltonian with some exceptions. In this paper, we characterize all such graphs that satisfy the assumption, but are not 1-tough. Using this, we verify the conjecture for k≤2.",
keywords = "Degree sum, Factor-critical graphs, Hamiltonian cycle, Toughness",
author = "Kawarabayashi, {Ken Ichi} and Katsuhiro Ota and Akira Saito",
year = "2001",
month = "9",
day = "28",
doi = "10.1016/S0012-365X(00)00386-1",
language = "English",
volume = "240",
pages = "71--82",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Hamiltonian cycles in n-factor-critical graphs

AU - Kawarabayashi, Ken Ichi

AU - Ota, Katsuhiro

AU - Saito, Akira

PY - 2001/9/28

Y1 - 2001/9/28

N2 - A graph G is said to be n-factor-critical if G - S has a 1-factor for any S ⊂ V(G) with |S| = n. In this paper, we prove that if G is a 2-connected n-factor-critical graph of order p with σ33/2(G)≥(p - n - 1), then G is hamiltonian with some exceptions. To extend this theorem, we define a (k,n)-factor-critical graph to be a graph G such that G - S has a k-factor for any S ⊂ V(G) with |S| = n. We conjecture that if G is a 2-connected (k,n)-factor-critical graph of order p with σ3(G)≥3/2(p - n - k), then G is hamiltonian with some exceptions. In this paper, we characterize all such graphs that satisfy the assumption, but are not 1-tough. Using this, we verify the conjecture for k≤2.

AB - A graph G is said to be n-factor-critical if G - S has a 1-factor for any S ⊂ V(G) with |S| = n. In this paper, we prove that if G is a 2-connected n-factor-critical graph of order p with σ33/2(G)≥(p - n - 1), then G is hamiltonian with some exceptions. To extend this theorem, we define a (k,n)-factor-critical graph to be a graph G such that G - S has a k-factor for any S ⊂ V(G) with |S| = n. We conjecture that if G is a 2-connected (k,n)-factor-critical graph of order p with σ3(G)≥3/2(p - n - k), then G is hamiltonian with some exceptions. In this paper, we characterize all such graphs that satisfy the assumption, but are not 1-tough. Using this, we verify the conjecture for k≤2.

KW - Degree sum

KW - Factor-critical graphs

KW - Hamiltonian cycle

KW - Toughness

UR - http://www.scopus.com/inward/record.url?scp=0035964595&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035964595&partnerID=8YFLogxK

U2 - 10.1016/S0012-365X(00)00386-1

DO - 10.1016/S0012-365X(00)00386-1

M3 - Article

VL - 240

SP - 71

EP - 82

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -