For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
15
views
26
references
 Top references
cited by
29
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      244
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Article: not found

      On nowhere dense graphs

      Author(s): ,
      Publication date Created:
      Publication date (Print):
      Journal: European Journal of Combinatorics
      Publisher: Elsevier BV

      Read this article at

      ScienceOpenPublisher
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references26

          • Record: found
          • Abstract: not found
          • Article: not found

          The monadic second-order logic of graphs. I. Recognizable sets of finite graphs

          Bruno Courcelle (1990)
          Article 0 comments Cited 225 times – based on 0 reviews     Review now
            • Record: found
            • Abstract: not found
            • Article: not found

            Quasi-random graphs

            F. R. K. Chung, R L Graham, A R M Wilson (1989)
            Article 0 comments Cited 127 times – based on 0 reviews     Review now
              • Record: found
              • Abstract: not found
              • Article: not found

              An extremal function for contractions of graphs

              Andrew Thomason (1984)
              Article 0 comments Cited 61 times – based on 0 reviews     Review now
                All references

                Author and article information

                Journal
                Title: European Journal of Combinatorics
                Abbreviated Title: European Journal of Combinatorics
                Publisher: Elsevier BV
                ISSN (Print): 01956698
                Publication date Created: May 2011
                Publication date (Print): May 2011
                Volume: 32
                Issue: 4
                Pages: 600-617
                Article
                DOI: 10.1016/j.ejc.2011.01.006
                SO-VID: 5d2b4eae-1e1d-48d0-9eae-511b67d961c5
                Copyright © © 2011
                License:

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Data availability:

                Comments

                Comment on this article

                Related Documents Log