Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message

Login Alert

Cancel
Log in
×
×
Register
Log In
(0) Cart
Logo for Cambridge Core from Cambridge University Press. Click to return to homepage.
Logo for Cambridge Core from Cambridge University Press. Click to return to homepage.
Cited by
  • Crossref logo 15
  • Google Scholar logo
Crossref Citations
Crossref logo
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Drmota, Michael Giménez, Omer and Noy, Marc 2011. Degree distribution in random planar graphs. Journal of Combinatorial Theory, Series A, Vol. 118, Issue. 7, p. 2102.
  • CrossRef
  • Google Scholar
DRMOTA, MICHAEL GIMÉNEZ, OMER and NOY, MARC 2011. The Maximum Degree of Series-Parallel Graphs. Combinatorics, Probability and Computing, Vol. 20, Issue. 4, p. 529.
  • CrossRef
  • Google Scholar
Drmota, Michael Fusy, Éric Kang, Mihyun Kraus, Veronika and Rué, Juanjo 2011. Asymptotic Study of Subcritical Graph Classes. SIAM Journal on Discrete Mathematics, Vol. 25, Issue. 4, p. 1615.
  • CrossRef
  • Google Scholar
Giménez, Omer Noy, Marc and Rué, Juanjo 2013. Graph classes with given 3‐connected components: Asymptotic enumeration and random graphs. Random Structures & Algorithms, Vol. 42, Issue. 4, p. 438.
  • CrossRef
  • Google Scholar
Drmota, M. Giménez, O. Noy, M. Panagiotou, K. and Steger, A. 2014. The maximum degree of random planar graphs. Proceedings of the London Mathematical Society, Vol. 109, Issue. 4, p. 892.
  • CrossRef
  • Google Scholar
BOUSQUET-MÉLOU, MIREILLE and WELLER, KERSTIN 2014. Asymptotic Properties of Some Minor-Closed Classes of Graphs. Combinatorics, Probability and Computing, Vol. 23, Issue. 5, p. 749.
  • CrossRef
  • Google Scholar
Panagiotou, Konstantinos 2016. Random Graphs, Geometry and Asymptotic Structure. p. 28.
  • CrossRef
  • Google Scholar
Giménez, Omer Mitsche, Dieter and Noy, Marc 2016. Maximum degree in minor-closed classes of graphs. European Journal of Combinatorics, Vol. 55, Issue. , p. 41.
  • CrossRef
  • Google Scholar
Panagiotou, Konstantinos Stufler, Benedikt and Weller, Kerstin 2016. Scaling limits of random graphs from subcritical classes. The Annals of Probability, Vol. 44, Issue. 5,
  • CrossRef
  • Google Scholar
Ehrenmüller, Julia and Rué, Juanjo 2016. Spanning trees in random series-parallel graphs. Advances in Applied Mathematics, Vol. 75, Issue. , p. 18.
  • CrossRef
  • Google Scholar
McDiarmid, Colin and Scott, Alex 2016. Random graphs from a block-stable class. European Journal of Combinatorics, Vol. 58, Issue. , p. 96.
  • CrossRef
  • Google Scholar
Drmota, Michael Ramos, Lander and Rué, Juanjo 2017. Subgraph statistics in subcritical graph classes. Random Structures & Algorithms, Vol. 51, Issue. 4, p. 631.
  • CrossRef
  • Google Scholar
GEORGAKOPOULOS, AGELOS and WAGNER, STEPHAN 2018. Subcritical Graph Classes Containing All Planar Graphs. Combinatorics, Probability and Computing, Vol. 27, Issue. 5, p. 763.
  • CrossRef
  • Google Scholar
Stufler, Benedikt 2020. Limits of random tree-like discrete structures. Probability Surveys, Vol. 17, Issue. none,
  • CrossRef
  • Google Scholar
Panagiotou, Konstantinos Ramzews, Leon and Stufler, Benedikt 2023. Exact-Size Sampling of Enriched Trees in Linear Time. SIAM Journal on Computing, Vol. 52, Issue. 5, p. 1097.
  • CrossRef
  • Google Scholar
Google Scholar Citations

View all Google Scholar citations for this article.

×
Cambridge University Press

Our Site

  • Accessibility
  • Contact & Help
  • Legal Notices

Our Platforms

  • Cambridge Core
  • Cambridge Open Engage
  • Cambridge Higher Education

Our Products

  • Journals
  • Books
  • Elements
  • Textbooks
  • Courseware

Join us online

Please choose a valid location.

  • Rights & Permissions
  • Copyright
  • Privacy Notice
  • Terms of Use
  • Cookies Policy
Cambridge University Press 2024

Cancel
Confirm
×

Save article to Kindle

To save this article to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

The Degree Sequence of Random Graphs from Subcritical Classes†
  • Volume 18, Issue 5
  • NICLA BERNASCONI (a1), KONSTANTINOS PANAGIOTOU (a1) and ANGELIKA STEGER (a1)
  • DOI: https://doi.org/10.1017/S0963548309990368
Please provide your Kindle email.
Available formats Please select a format to save.
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

The Degree Sequence of Random Graphs from Subcritical Classes†
  • Volume 18, Issue 5
  • NICLA BERNASCONI (a1), KONSTANTINOS PANAGIOTOU (a1) and ANGELIKA STEGER (a1)
  • DOI: https://doi.org/10.1017/S0963548309990368
Available formats Please select a format to save.
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

The Degree Sequence of Random Graphs from Subcritical Classes†
  • Volume 18, Issue 5
  • NICLA BERNASCONI (a1), KONSTANTINOS PANAGIOTOU (a1) and ANGELIKA STEGER (a1)
  • DOI: https://doi.org/10.1017/S0963548309990368
Available formats Please select a format to save.
×
×

Reply to: Submit a response

Contents help
Close Contents help

- No HTML tags allowed
- Web page URLs will display as text only
- Lines and paragraphs break automatically
- Attachments, images or tables are not permitted

Please enter your response.

Your details

Email help
Close Email help

Your email address will be used in order to notify you when your comment has been reviewed by the moderator and in case the author(s) of the article or the moderator need to contact you directly.

Please enter a valid email address.
You have entered the maximum number of contributors

Conflicting interests

Do you have any conflicting interests? * Conflicting interests help

Close Conflicting interests help

Please list any fees and grants from, employment by, consultancy for, shared ownership in or any close relationship with, at any time over the preceding 36 months, any organisation whose interests may be affected by the publication of the response. Please also list any non-financial associations or interests (personal, professional, political, institutional, religious or other) that a reasonable reader would want to know about in relation to the submitted work. This pertains to all the authors of the piece, their spouses or partners.