Lower bounds for locally highly connected graphs

Anna Maria Adamaszek; Michal Jan Adamaszek; Matthias Mnich; Jens M. Schmidt

doi:10.1007/s00373-016-1686-y

Lower bounds for locally highly connected graphs

Anna Maria Adamaszek, Michal Jan Adamaszek, Matthias Mnich, Jens M. Schmidt

2 Citations (Scopus)

Original language	English
Journal	Graphs and Combinatorics
Volume	32
Issue number	5
Pages (from-to)	1641-1650
Number of pages	10
ISSN	0911-0119
DOIs	https://doi.org/10.1007/s00373-016-1686-y
Publication status	Published - 1 Sept 2016

Keywords

Local graph properties
k-Connectivity
Lower bounds
Rigidity

Access to Document

10.1007/s00373-016-1686-y

Cite this

@article{af75957dbc05400981d59b03c7006a02,

title = "Lower bounds for locally highly connected graphs",

keywords = "Local graph properties, k-Connectivity, Lower bounds, Rigidity",

author = "Adamaszek, {Anna Maria} and Adamaszek, {Michal Jan} and Matthias Mnich and Schmidt, {Jens M.}",

year = "2016",

month = sep,

day = "1",

doi = "10.1007/s00373-016-1686-y",

language = "English",

volume = "32",

pages = "1641--1650",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer",

number = "5",

}

TY - JOUR

T1 - Lower bounds for locally highly connected graphs

AU - Adamaszek, Anna Maria

AU - Adamaszek, Michal Jan

AU - Mnich, Matthias

AU - Schmidt, Jens M.

PY - 2016/9/1

Y1 - 2016/9/1

KW - Local graph properties

KW - k-Connectivity

KW - Lower bounds

KW - Rigidity

U2 - 10.1007/s00373-016-1686-y

DO - 10.1007/s00373-016-1686-y

M3 - Journal article

SN - 0911-0119

VL - 32

SP - 1641

EP - 1650

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 5

ER -

Lower bounds for locally highly connected graphs

Keywords

Access to Document

Fingerprint

Cite this