Lower bounds for locally highly connected graphs
From MaRDI portal
(Redirected from Publication:343698)
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
- scientific article; zbMATH DE number 67319 (Why is no real title available?)
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs
- Graphs with prescribed local connectivities
- Locally connected graphs
- Locally tree-like graphs
- Lower-bound theorems for pseudomanifolds
- On extremal sizes of locally \(k\)-tree graphs.
- Practical graph isomorphism. II.
- Real root conjecture fails for five- and higher-dimensional spheres
- Some combinatorial properties of flag simplicial pseudomanifolds and spheres
- Vanishing theorems and conjectures for the 2-homology of right-angled Coxeter groups
Cited in
(4)- scientific article; zbMATH DE number 5016633 (Why is no real title available?)
- Deficiency and forbidden subgraphs of connected, locally-connected graphs
- scientific article; zbMATH DE number 4101244 (Why is no real title available?)
- A note on cycles in locally Hamiltonian and locally Hamilton-connected graphs
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)
