Characterization of minimally \((2,l)\)-connected graphs
type: Item
instance of: scholarly article
title: Characterization of minimally \((2,l)\)-connected graphs
zbMATH Open document ID: 1260.05087
author: Xiaofeng Gu
author: Hong-Jian Lai
author: Senmei Yao
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6150505
zbMATH Keywords: combinatorial problems
zbMATH Keywords: connectivity
zbMATH Keywords: minimally \(k\)-connected graphs
zbMATH Keywords: \(l\)-connectivity
zbMATH Keywords: \((k,l)\)-connected graphs
zbMATH Keywords: minimally \((2,l)\)-connected graphs
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.09.012
OpenAlex ID: W2078756938
cites work: A Generalization of Line Connectivity and Optimally Invulnerable Graphs
cites work: Q4830805
cites work: Q3097395
cites work: Minimally 2-edge connected graphs
cites work: Minimally 2-connected graphs.
cites work: Q3898529
cites work: Q3953800
cites work: Minimally (k, k)‐edge‐connected graphs
cites work: Q4243806
cites work: On the \(\ell\)-connectivity of a graph
cites work: On Minimal Blocks
cites work: Q3620525
DOI: 10.1016/J.IPL.2011.09.012
description: scientific article; zbMATH DE number 6150505