Georgakopoulos, Agelos and Wagner, Stephan (2018) Subcritical graph classes containing all planar graphs. Combinatorics, Probability and Computing, 27 (5). pp. 763-773. doi:10.1017/S0963548318000056 ISSN 0963-5483.

Preview

PDF WRAP-subcritical-graph-classes-containing-planar-graphs-Georgakopoulos-2018.pdf - Accepted Version - Requires a PDF viewer. Download (394Kb) | Preview

Request Changes to record.

Abstract

We construct minor-closed addable families of graphs that are subcritical and contain all planar graphs. This contradicts (one direction of) a well-known conjecture of Noy.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics
Divisions:	Faculty of Science, Engineering and Medicine > Science > Mathematics
Library of Congress Subject Headings (LCSH):	Random graphs, Combinatorial analysis, Graph theory
Journal or Publication Title:	Combinatorics, Probability and Computing
Publisher:	Cambridge University Press
ISSN:	0963-5483
Official Date:	September 2018
Dates:	Date Event September 2018 Published 22 March 2018 Available 5 January 2018 Valid 20 December 2017 Accepted
Volume:	27
Number:	5
Page Range:	pp. 763-773
DOI:	10.1017/S0963548318000056
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Date of first compliant deposit:	20 June 2019
Date of first compliant Open Access:	21 June 2019
RIOXX Funder/Project Grant:	Project/Grant ID RIOXX Funder Name Funder ID 639046 H2020 European Research Council http://dx.doi.org/10.13039/100010663 96236 National Research Foundation (South Africa) http://viaf.org/viaf/137694659
Open Access Version:	ArXiv

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads