Connectivity of addable graph classes

Paul Balister, Béla Bollobás, Stefanie Gerke

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	577-584
Number of pages	8
Journal	Journal of Combinatorial Theory, Series B
Volume	98
Issue number	3
Early online date	18 Oct 2007
DOIs	https://doi.org/10.1016/j.jctb.2007.09.003
Publication status	Published - May 2008

Keywords

@article{377bcce4414f4cea98925ff7eca2f5e7,

title = "Connectivity of addable graph classes",

keywords = "random addable graphs, connectivity, 2-edge cuts",

author = "Paul Balister and B{\'e}la Bollob{\'a}s and Stefanie Gerke",

year = "2008",

month = may,

doi = "10.1016/j.jctb.2007.09.003",

language = "English",

volume = "98",

pages = "577--584",

journal = "Journal of Combinatorial Theory, Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Connectivity of addable graph classes

AU - Balister, Paul

AU - Bollobás, Béla

AU - Gerke, Stefanie

PY - 2008/5

Y1 - 2008/5

KW - random addable graphs

KW - connectivity

KW - 2-edge cuts

U2 - 10.1016/j.jctb.2007.09.003

DO - 10.1016/j.jctb.2007.09.003

M3 - Article

SN - 0095-8956

VL - 98

SP - 577

EP - 584

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

IS - 3

ER -