On the 3-restricted edge connectivity of permutation graphs
type: Item
instance of: scholarly article
title: On the 3-restricted edge connectivity of permutation graphs
zbMATH Open document ID: 1172.05036
author: C. Balbuena
author: Diego González-Moreno
author: Xavier Marcote
published in: Discrete Applied Mathematics
publication date: 2009-06-30T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5572001
zbMATH Keywords: connectivity
zbMATH Keywords: permutation graph
zbMATH Keywords: super \(k\)-restricted edge connectivity
zbMATH Keywords: \(k\)-edge degree
zbMATH Keywords: perfect matching
MaRDI profile type: Publication
full work available at URL: j.dam.2008.04.010
OpenAlex ID: W1980185895
cites work: Extraconnectivity of graphs with large minimum degree and girth
cites work: On restricted connectivities of permutation graphs
cites work: Reliability of interconnection networks modeled by a product of graphs
cites work: On the edge-connectivity and restricted edge-connectivity of a product of graphs
cites work: Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
cites work: Large graphs with given degree and diameter. II
cites work: Synthesis of reliable networks - a survey
cites work: Circulants and their connectivities
cites work: Edge-cuts leaving components of order at least three
cites work: Q4350166
cites work: On computing a conditional edge-connectivity of a graph
cites work: Extraconnectivity of graphs with large girth
cites work: On the extraconnectivity of graphs
cites work: Q3490015
cites work: Distance and connectivity measures in permutation graphs
cites work: Conditional connectivity
cites work: Large survivable nets and the generalized prisms
cites work: Q4260012
cites work: Edge cuts leaving components of order at least \(m\)
cites work: Q3834076
cites work: Connectivity of generalized prisms over G
cites work: Super restricted edge-connectivity of vertex-transitive graphs
cites work: On restricted edge-connectivity of graphs.
cites work: A proof of an inequality concerning \(k\)-restricted edge connectivity
DOI: 10.1016/J.DAM.2008.04.010
description: scientific article; zbMATH DE number 5572001