Long cycles in triangle-free graphs with prescribed independence number and connectivity
type: Item
instance of: scholarly article
title: Long cycles in triangle-free graphs with prescribed independence number and connectivity
zbMATH Open document ID: 1042.05055
author: Hikoe Enomoto
author: Atsushi Kaneko
author: Akira Saito
author: Bing Wei
published in: Journal of Combinatorial Theory. Series B
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 2082030
zbMATH Keywords: Longest cycle
zbMATH Keywords: Triangle-free graph
zbMATH Keywords: Independence number
zbMATH Keywords: Connectivity
MaRDI profile type: Publication
full work available at URL: j.jctb.2003.05.002
OpenAlex ID: W2157627899
cites work: Longest cycles in triangle-free graphs
cites work: Q5688996
cites work: Q4350166
cites work: A note on Hamiltonian circuits
cites work: Cycles in graphs with prescribed stability number and connectivity
cites work: The Chvátal-Erdös condition for cycles in triangle-free graphs
DOI: 10.1016/J.JCTB.2003.05.002
Recommended article: Q3070257
Recommended article: Longest cycles in \(k\)-connected graphs with given independence number
Recommended article: Longest cycles in 3-connected graphs with given independence number
Recommended article: Longest cycles in triangle-free graphs
Recommended article: Q3686747
Recommended article: Long cycles in certain graphs of large degree
Recommended article: Q4388360
Recommended article: Long cycles in 3-connected graphs
Recommended article: Long cycles in subgraphs with prescribed minimum degree
Recommended article: Cycles in triangle-free graphs of large chromatic number
description: scientific article; zbMATH DE number 2082030