Lower bounds for locally highly connected graphs

DOI10.1007/s00373-016-1686-yzbMath1349.05192OpenAlexW2283303017WikidataQ58203653 ScholiaQ58203653MaRDI QIDQ343698

Michał Adamaszek, Anna 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

zbMATH Keywords

rigiditylower bounds\(k\)-connectivitylocal graph properties

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (2)

A note on cycles in locally Hamiltonian and locally Hamilton-connected graphs ⋮ Deficiency and forbidden subgraphs of connected, locally-connected graphs

Uses Software

• nauty
• Traces

Cites Work

• Unnamed Item
• Contractions, cycle double covers, and cyclic colorings in locally connected graphs
• 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
• Practical graph isomorphism. II.
• Real root conjecture fails for five- and higher-dimensional spheres
• On extremal sizes of locally k-tree graphs
• Locally tree-like graphs
• Locally connected graphs

This page was built for publication: Lower bounds for locally highly connected graphs