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

      \(k\)-forested choosability of planar graphs and sparse graphs

      Author(s): , ,
      Publication date Created:
      Publication date (Print):
      Journal: Discrete Mathematics
      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

          Author and article information

          Journal
          Title: Discrete Mathematics
          Abbreviated Title: Discrete Mathematics
          Publisher: Elsevier BV
          ISSN (Print): 0012365X
          Publication date Created: March 2012
          Publication date (Print): March 2012
          Volume: 312
          Issue: 5
          Pages: 999-1005
          Article
          DOI: 10.1016/j.disc.2011.10.031
          SO-VID: 23668723-dde3-4e6d-9b5e-784d9160c34a
          Copyright © © 2012
          License:

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

          https://www.elsevier.com/open-access/userlicense/1.0/

          History

          Data availability:

          Comments

          Comment on this article

          Related Documents Log