Lower bounds for locally highly connected graphs
From MaRDI portal
Publication:343698
DOI10.1007/S00373-016-1686-YzbMATH Open1349.05192OpenAlexW2283303017WikidataQ58203653 ScholiaQ58203653MaRDI QIDQ343698FDOQ343698
Authors: Anna Adamaszek, Michał Adamaszek, Jens M. Schmidt, Matthias Mnich 
Publication date: 29 November 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-016-1686-y
Recommendations
- Lower-bounds on the connectivities of a graph
- On local connectivity of graphs
- Lower bounds on the vertex-connectivity of digraphs and graphs
- A lower bound of the \(l\)-edge-connectivity and optimal graphs
- The connectivities of locally finite primitive graphs
- On local connectivity of graphs with given clique number
- scientific article; zbMATH DE number 861407
- On locally \(k\)-critically \(n\)-connected graphs
- scientific article; zbMATH DE number 6383846
- scientific article; zbMATH DE number 4101244
Cites Work
- Practical graph isomorphism. II.
- Locally connected graphs
- Title not available (Why is that?)
- Real root conjecture fails for five- and higher-dimensional spheres
- Graphs with prescribed local connectivities
- Lower-bound theorems for pseudomanifolds
- Vanishing theorems and conjectures for the 2-homology of right-angled Coxeter groups
- Some combinatorial properties of flag simplicial pseudomanifolds and spheres
- On extremal sizes of locally \(k\)-tree graphs.
- Locally tree-like graphs
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs
Cited In (4)
Uses Software
This page was built for publication: Lower bounds for locally highly connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343698)
