Contractible cycles in graphs with large minimum degree
type: Item
instance of: scholarly article
title: Contractible cycles in graphs with large minimum degree
zbMATH Open document ID: 0883.05090
DOI: 10.1016/S0012-365X(96)00017-9
author: Yoshimi Egawa
published in: Discrete Mathematics
publication date: 1997-08-10T00:00:00Z
review text: It is proved that if \(k\geq 2\), then with the exception of \(K_4\) and \(K_5\), every \(k\)-connected graph \(G\) of minimum degree at least \([3k/2]\) contains an induced cycle \(C\) such that \(G-V(C)\) is \((k-1)\)-connected.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1047082
zbMATH Keywords: contractible cycles
zbMATH Keywords: \(k\)-connected graph
zbMATH Keywords: minimum degree
reviewed by: Jørgen Bang-Jensen
MaRDI profile type: Publication
cites work: Distribution of contractible edges in k-connected graphs
cites work: Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
cites work: Contractible edges in non-separating cycles
cites work: Q3487381
cites work: Nonseparating cycles inK-Connected graphs
cites work: Non-separating induced cycles in graphs
full work available at URL: s0012-365x(96)00017-9
OpenAlex ID: W2023639312
description: scientific article; zbMATH DE number 1047082