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
2
references
Top references
cited by
17
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,367
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
Choosability and edge choosability of planar graphs without five cycles
Author(s):
Weifan Wang
,
Ko-Wei Lih
Publication date
Created:
July 2002
Publication date
(Print):
July 2002
Journal:
Applied Mathematics Letters
Publisher:
Elsevier BV
Read this article at
ScienceOpen
Publisher
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.
Related collections
ScienceOpen Research
Most cited references
2
Record
: found
Abstract
: not found
Article
: not found
List edge chromatic number of graphs with large girth
A.V Kostochka
(1992)
0
comments
Cited
7
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Graphs of degree 4 are 5-edge-choosable
Martin Juvan
,
Bojan Mohar
,
Riste ??krekovski
(1999)
0
comments
Cited
1
times
– based on
0
reviews
Review now
Bookmark
All references
Author and article information
Journal
Title:
Applied Mathematics Letters
Abbreviated Title:
Applied Mathematics Letters
Publisher:
Elsevier BV
ISSN (Print):
08939659
Publication date Created:
July 2002
Publication date (Print):
July 2002
Volume
: 15
Issue
: 5
Pages
: 561-565
Article
DOI:
10.1016/S0893-9659(02)80007-6
SO-VID:
b0aed5d6-6ef6-4366-b522-c4fccd721043
Copyright ©
© 2002
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,367
Matrix Choosability
Authors:
Matt DeVos
A Note on Group Choosability of Graphs with Girth at least 4
Authors:
G. R. OMIDI
\(k\)-forested choosability of planar graphs and sparse graphs
Authors:
Xin Zhang
,
Guizhen Liu
,
Jian-Liang Wu
See all similar
Cited by
17
Planar Graphs without 7-Cycles Are 4-Choosable
Authors:
Babak Farzad
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
Authors:
Wei-Fan Wang
,
Ko-Wei Lih
Equitable List-Coloring for C 5-Free Plane Graphs Without Adjacent Triangles
Authors:
Junlei Zhu
,
Yuehua BU
,
Xiao Min
See all cited by
Most referenced authors
5
Bojan Mohar
A.V Kostochka
A.V. Kostochka
See all reference authors