Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number
type: Item
instance of: scholarly article
title: Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number
zbMATH Open document ID: 1404.05104
author: Lutz Volkmann
publication date: 2019-02-07T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7014699
zbMATH Keywords: edge-connectivity
zbMATH Keywords: clique number
zbMATH Keywords: maximally edge-connected graphs
zbMATH Keywords: super-edge-connected graphs
MaRDI profile type: Publication
full work available at URL: dmgt.2096
OpenAlex ID: W2803874672
cites work: Q3922713
cites work: A Graph-Theoretic Approach to a Communications Problem
cites work: Maximally edge-connected and vertex-connected graphs and digraphs: A survey
cites work: Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs
cites work: Q5781249
cites work: Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Wikidata QID: Q129818509
DOI: 10.7151/DMGT.2096
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 7014699