Subcritical graph classes containing all planar graphs
classification
🧮 math.CO
keywords
graphsplanarsubcriticaladdableclassesconjectureconstructcontain
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.