On the connectivity of random graphs from addable classes

Mihyun Kang; Konstantinos Panagiotou

doi:10.1016/j.jctb.2012.12.001

On the connectivity of random graphs from addable classes

Mihyun Kang, Konstantinos Panagiotou

Institute of Discrete Mathematics (5050)

Research output: Contribution to journal › Article

Original language	English
Pages (from-to)	306-312
Journal	Journal of Combinatorial Theory / B
Volume	103
DOIs	https://doi.org/10.1016/j.jctb.2012.12.001
Publication status	Published - 2013

Fields of Expertise

Information, Communication & Computing

Treatment code (Nähere Zuordnung)

Basic - Fundamental (Grundlagenforschung)

Access to Document

10.1016/j.jctb.2012.12.001

http://www.journals.elsevier.com/journal-of-combinatorial-theory-series-b/

1 Finished

DFG - Phase transit.rand.graphs - Phase transitions in random graphs and random graph processes
Pachon Pinzon, A. Y. & Kang, M.
1/03/12 → 30/09/14
Project: Research project

Cite this

@article{006a1ea7ea0a4c8db3377bf5ce2b9a69,

title = "On the connectivity of random graphs from addable classes",

author = "Mihyun Kang and Konstantinos Panagiotou",

year = "2013",

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

language = "English",

volume = "103",

pages = "306--312",

journal = "Journal of Combinatorial Theory / B",

issn = "0095-8956",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - On the connectivity of random graphs from addable classes

AU - Kang, Mihyun

AU - Panagiotou, Konstantinos

PY - 2013

Y1 - 2013

UR - http://www.journals.elsevier.com/journal-of-combinatorial-theory-series-b/

U2 - 10.1016/j.jctb.2012.12.001

DO - 10.1016/j.jctb.2012.12.001

M3 - Article

VL - 103

SP - 306

EP - 312

JO - Journal of Combinatorial Theory / B

JF - Journal of Combinatorial Theory / B

SN - 0095-8956

ER -

On the connectivity of random graphs from addable classes

Fields of Expertise

Treatment code (Nähere Zuordnung)

Access to Document

DFG - Phase transit.rand.graphs - Phase transitions in random graphs and random graph processes

Cite this