Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number. (Q2918608)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6092278
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number. |
scientific article; zbMATH DE number 6092278 |
Statements
8 October 2012
0 references
oriented graph
0 references
edge-connectivity
0 references
super-edge-connectivity
0 references
degree sequence
0 references
clique number
0 references
Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number. (English)
0 references
0.9127271771430968
0 references
0.8985617756843567
0 references
