On the number of components of \((k,g)\)-cages after vertex deletion
type: Item
instance of: scholarly article
title: On the number of components of \((k,g)\)-cages after vertex deletion
zbMATH Open document ID: 1173.05336
author: C. Balbuena
author: Mirka Miller
author: Yuqing Lin
published in: Discrete Applied Mathematics
publication date: 2009-06-24T00:00:00Z
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5569462
zbMATH Keywords: cages
zbMATH Keywords: connectivity
zbMATH Keywords: disconnecting set
MaRDI profile type: Publication
full work available at URL: j.dam.2008.12.005
OpenAlex ID: W2080585220
cites work: On the order and size of \(s\)-geodetic digraphs with given connectivity
cites work: The Smallest Cubic Graphs of Girth Nine
cites work: Q4350166
cites work: \((k,g)\)-cages are 3-connected
cites work: Q5725269
cites work: Maximally connected digraphs
cites work: Connectivity of cages
cites work: Q4242926
cites work: Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages
cites work: All (k;g)‐cages are edge‐superconnected
cites work: Edge-superconnectivity of cages
cites work: (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected
cites work: Sufficient conditions for maximally connected dense graphs
cites work: Q5785712
DOI: 10.1016/J.DAM.2008.12.005
description: scientific article; zbMATH DE number 5569462