scientific article; zbMATH DE number 1062587
From MaRDI portal
Publication:4355069
DOI10.1002/(SICI)1097-0118(199709)26:1%3C27::AID-JGT4%3E3.0.CO;2-JzbMATH Open0879.05049MaRDI QIDQ4355069FDOQ4355069
Authors: Peter Dankelmann, Lutz Volkmann 
Publication date: 22 December 1997
Title of this publication is not available (Why is that?)
Recommendations
Cited In (24)
- Super Edge-Connected Linear Hypergraphs
- Degree sequence conditions for equal edge‐connectivity and minimum degree, depending on the clique number
- Neighborhood and degree conditions for super-edge-connected bipartite digraphs
- Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- On the edge-connectivity of \(C_4\)-free graphs
- Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\)
- Super edge-connectivity and zeroth-order Randić index
- Super-edge-connectivity and zeroth-order Randić index
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Local-edge-connectivity in digraphs and oriented graphs
- Inverse degree and edge-connectivity
- Sufficient conditions for restricted-edge-connectivity to be optimal
- Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)
- Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
- Degree sequence conditions for maximally edge-connected graphs depending on the clique number
- Title not available (Why is that?)
- Degree sequences of optimally edge-connected multigraphs.
- Title not available (Why is that?)
- Degree sequence conditions for maximally and super edge-connected digraphs depending on the clique number
- On optimizing edge connectivity of product graphs
- Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs
- Degree sequence conditions for maximally edge-connected oriented graphs
- Degree sequences and edge connectivity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355069)
