A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition | Zendy

Kaneko Atsushi | Zendy; Yoshimoto Kiyoshi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition

Author(s) -

Kaneko Atsushi,

Yoshimoto Kiyoshi

Publication year - 2003

Publication title -

journal of graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.164

H-Index - 54

eISSN - 1097-0118

pISSN - 0364-9024

DOI - 10.1002/jgt.10119

Subject(s) - combinatorics , mathematics , independence number , graph , graph minor , voltage graph , symmetric graph , line graph , cubic graph , discrete mathematics , complement graph , quartic graph , null graph

Chvátal and Erdös showed that a k ‐connected graph with independence number at most k and order at least three is hamiltonian. In this paper, we show that a graph contains a 2‐factor with two components, i.e., the graph can be divided into two cycles if the graph is k (≥ 4)‐connected with order at least six and independence number at most k . © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 269–279, 2003

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research