ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
5
views
0
references
Top references
cited by
77
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,357
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
Every Planar Graph Is 5-Choosable
Author(s):
C. Thomassen
Publication date
Created:
September 1994
Publication date
(Print):
September 1994
Journal:
Journal of Combinatorial Theory, Series B
Publisher:
Elsevier BV
Read this article at
ScienceOpen
Publisher
Further versions
open (via crossref license)
Powered by
Review
Review article
Invite someone to review
Bookmark
Cite as...
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.
Abstract
Related collections
Exponential Random Graph Models
Author and article information
Journal
Title:
Journal of Combinatorial Theory, Series B
Abbreviated Title:
Journal of Combinatorial Theory, Series B
Publisher:
Elsevier BV
ISSN (Print):
00958956
Publication date Created:
September 1994
Publication date (Print):
September 1994
Volume
: 62
Issue
: 1
Pages
: 180-181
Article
DOI:
10.1006/jctb.1994.1062
SO-VID:
8b6610e9-361c-433e-87ca-24da73accbeb
Copyright ©
© 1994
License:
http://www.elsevier.com/tdm/userlicense/1.0/
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
2,357
Another proof of the 5-choosability of K5-minor-free graphs
Authors:
Wenjie He
,
Wenjing Miao
,
Yufa Shen
A \({(3,1)}^{\ast }\)-choosable theorem on toroidal graphs
Authors:
Li Li Zhang
Planar graphs without intersecting 5 -cycles are 4 -choosable
Authors:
Dai-Qiang Hu
,
Jian‐Liang Wu
See all similar
Cited by
77
List Homomorphisms to Reflexive Graphs
Authors:
Tomás Feder
,
Pavol Hell
A short list color proof of Grötzsch's theorem
Authors:
Carsten Thomassen
Color-Critical Graphs on a Fixed Surface
Authors:
Carsten Thomassen
See all cited by