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

      Another proof of the 5-choosability of K5-minor-free graphs

      Author(s):
      Publication date:
      Journal: Discrete Mathematics

      Read this article at

      ScienceOpenPublisher
      Bookmark
          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
          DOI:: 10.1016/j.disc.2007.07.089

          ScienceOpen disciplines: Combinatorics,Discrete mathematics & Graph theory,Mathematics
          Data availability:
          ScienceOpen disciplines: Combinatorics, Discrete mathematics & Graph theory, Mathematics

          Comments

          Comment on this article